3 Feb 2005
CS 3243 - Game playing
6
Example : Game of NIM
Several piles of sticks are given. We represent the
configuration of the piles by a
monotone sequence of integers, such as (1,3,5). A player may remove, in one turn, any number of sticks from one pile. Thus, (1,3,5)
would become (1,1,3) if the
player were to remove 4 sticks from the last pile. The player who takes the last stick loses.
nRepresent the
NIM game (1, 2, 2) as a game tree.
