TY  - BOOK
AU  - Gallego,Pamela Mae E.
TI  - A winning strategy for a Mancala Game
PY  - 2002///
KW  - Undergraduate Thesis
KW  - AMAT200
N1  - Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002
N2  - The status labeling procedure determines the path in a game tree that leads to the winning strategy for the players. The game tree consists of two nodes namely the MAX and MIN nodes. These nodes indicate the status of the game and thus the player concludes whether he is on the best way to win the game. Winning strategies of the game can be identified that is, even without examining the game tree node by node we may able to conclude that the strategy is a winning strategy. However, optimal strategy in a big game tree cannot be identified. But for game trees like (3,3) sungka game we can easily identify the optimal strategy since the game tree is enumerated
ER  -