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

A winning strategy for the Dama game / Annalou B. Delfino

By: Material type: TextTextLanguage: English Publication details: 2002Description: 30 leavesSubject(s): Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002 Abstract: The dama game was properly defined by its given rule. A mathematical representation to the problem was obtained. The game tree of dama consists of two nodes namely the MAX and the MIN nodes. Each node represents the status of the game based on the rule of the game. The tree was subdivided into levels where the first level is called the MAX level; the second level is the MIN level and so on. The sixth level of the game tree was considered as the terminal level and the nodes are also the terminal node since the number of nodes at the next level is no longer manageable. An evaluation function then was used to evaluate each terminal node at the level six. Status labeling procedure was employed then to evaluate the ancestor nodes. This procedure determines the winning path of the game. Results showed that in a 4 x 4 dama game tree, the first player has high chance of winning the game. Optimality however cannot be identified for large game trees
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 D45 (Browse shelf(Opens below)) Not For Loan 3UPML00010942
Thesis Thesis University Library Archives and Records Preservation Copy LG993.5 2002 A64 D45 (Browse shelf(Opens below)) Not For Loan 3UPML00020912

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

The dama game was properly defined by its given rule. A mathematical representation to the problem was obtained. The game tree of dama consists of two nodes namely the MAX and the MIN nodes. Each node represents the status of the game based on the rule of the game. The tree was subdivided into levels where the first level is called the MAX level; the second level is the MIN level and so on. The sixth level of the game tree was considered as the terminal level and the nodes are also the terminal node since the number of nodes at the next level is no longer manageable. An evaluation function then was used to evaluate each terminal node at the level six. Status labeling procedure was employed then to evaluate the ancestor nodes. This procedure determines the winning path of the game. Results showed that in a 4 x 4 dama game tree, the first player has high chance of winning the game. Optimality however cannot be identified for large game trees

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