NON-LOSING STRATEGIES FOR CASTELLAN
| dc.advisor | Dr. Chad Wiley | en_US |
| dc.college | las | en_US |
| dc.contributor.author | Suptic, Jason Robert | |
| dc.date.accessioned | 2017-09-11T18:51:29Z | |
| dc.date.available | 2017-09-11T18:51:29Z | |
| dc.date.created | June 2017 | en_US |
| dc.date.issued | 2017-09-11 | |
| dc.department | mathematics, computer science, and economics | en_US |
| dc.description.abstract | Non-losing strategies in games ensure a player can play in a manner in which, though they may not win, they do not lose. This thesis explores non-losing strategies for a restricted version of Castellan. Castellan is a game where each player attempts to best the other by using walls connected to towers to enclose regions with the most towers bordering them. The question was narrowed to games with a rectangular layout. Research was conducted using a program written to enumerate games of relatively small size, ones having fewer than five unit regions. After observing outcomes of the computer program, conjectures were formed and lemmas proved. In the end, it was found that with the restricted rules, the player to place the first piece has a non-losing strategy for games where the rows and columns both have an odd number of tower locations, or where exclusively the rows or towers have an odd number of tower locations. Lemmas and corollaries that are proved are used to support this fact. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/3577 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Game Theory, Graph Theory, Castellan, Zero Sum | en_US |
| dc.title | NON-LOSING STRATEGIES FOR CASTELLAN | en_US |
| dc.type | Thesis | en_US |