A winning strategy for the Dama game / (Record no. 175)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01616nam a2200241 4500 |
001 - CONTROL NUMBER | |
control field | UPMIN-00000009099 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | UPMIN |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20230207171522.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 230106b |||||||| |||| 00| 0 eng d |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | DLC |
Transcribing agency | UPMin |
Modifying agency | upmin |
041 ## - LANGUAGE CODE | |
Language code of text/sound track or separate title | eng |
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) | |
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) | LG993.5 2002 |
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) | A64 D45 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Delfino, Annalou B. |
9 (RLIN) | 1138 |
245 00 - TITLE STATEMENT | |
Title | A winning strategy for the Dama game / |
Statement of responsibility, etc. | Annalou B. Delfino |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Date of publication, distribution, etc. | 2002 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 30 leaves |
502 ## - DISSERTATION NOTE | |
Dissertation note | Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002 |
520 3# - SUMMARY, ETC. | |
Summary, etc. | 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 |
658 ## - INDEX TERM--CURRICULUM OBJECTIVE | |
Main curriculum objective | Undergraduate Thesis |
Curriculum code | AMAT200 |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
a | Fi |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
a | UP |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Library of Congress Classification |
Koha item type | Thesis |
Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Status | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Accession Number | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Library of Congress Classification | Not For Loan | Preservation Copy | University Library | University Library | Archives and Records | 2002-05-27 | donation | UAR-T-gd097 | LG993.5 2002 A64 D45 | 3UPML00020912 | 2022-09-21 | 2022-09-21 | Thesis | ||||
Library of Congress Classification | Not For Loan | Room-Use Only | College of Science and Mathematics | University Library | Theses | 2002-06-20 | donation | CSM-T-1059 | LG993.5 2002 A64 D45 | 3UPML00010942 | 2022-09-21 | 2022-09-21 | Thesis |