Local cover image
Local cover image
Local cover image
Local cover image

A winning strategy for a Mancala Game / Pamela Mae E. Gallego

By: Material type: TextTextLanguage: English Publication details: 2002Description: 37 leavesSubject(s): Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002 Abstract: 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.
List(s) this item appears in: BS Applied Mathematics
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Collection Call number Status Date due Barcode
Thesis Thesis University Library Theses Room-Use Only LG993.5 2002 A64 G35 (Browse shelf(Opens below)) Not For Loan 3UPML00010950
Thesis Thesis University Library Archives and Records Preservation Copy LG993.5 2002 A64 G35 (Browse shelf(Opens below)) Not For Loan 3UPML00020900

Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002

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.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image Local cover image
 
University of the Philippines Mindanao
The University Library, UP Mindanao, Mintal, Tugbok District, Davao City, Philippines
Email: library.upmindanao@up.edu.ph
Contact: (082)295-7025
Copyright @ 2022 | All Rights Reserved