000			01335nam a2200241 4500
001			UPMIN-00000009097
003			UPMIN
005			20230207171818.0
008			230112b |||||||| |||| 00| 0 eng d
040			_aDLC _cUPMin _dupmin
041			_aeng
090		0	_aLG993.5 2002 _bA64 G35
100	1		_aGallego, Pamela Mae E. _91308
245	0	0	_aA winning strategy for a Mancala Game / _cPamela Mae E. Gallego
260			_c2002
300			_a37 leaves
502			_aThesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002
520	3		_aThe 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.
658			_aUndergraduate Thesis _cAMAT200
905			_aFi
905			_aUP
942			_2lcc _cTHESIS
999			_c173 _d173