dc.contributor.author | Mullen, Todd | |
dc.date.accessioned | 2016-08-31T14:08:43Z | |
dc.date.available | 2016-08-31T14:08:43Z | |
dc.date.issued | 2016-08-31T14:08:43Z | |
dc.identifier.uri | http://hdl.handle.net/10222/72146 | |
dc.description.abstract | Several self-referential impartial combinatorial games have been studied and some have been solved. However, by making small changes to the rules we can get vastly different outcomes. We look at many new games, solving some, and coming up short in others, but in particular, we look at Minnie and Wynnie. With Minnie representing a small tweak to the rules of Nim and Wynnie representing a small tweak to the rules of Wythoff, one might expect rather uninteresting, repetitive results. However, that is far from the case.
We solve Wynnie and misere Wynnie, and we nearly solve Minnie up to three stacks. In addition, we solve other new games Nimb and Nimtb, and we look at Wynnie on graphs. | en_US |
dc.language.iso | en | en_US |
dc.subject | game theory | en_US |
dc.title | The Self-Referential Games Minnie and Wynnie and Some Variants | en_US |
dc.date.defence | 2016-08-19 | |
dc.contributor.department | Department of Mathematics & Statistics - Math Division | en_US |
dc.contributor.degree | Master of Science | en_US |
dc.contributor.external-examiner | n/a | en_US |
dc.contributor.graduate-coordinator | David Iron | en_US |
dc.contributor.thesis-reader | Jason Brown | en_US |
dc.contributor.thesis-reader | Margaret-Ellen Messinger | en_US |
dc.contributor.thesis-supervisor | Richard Nowakowski | en_US |
dc.contributor.ethics-approval | Not Applicable | en_US |
dc.contributor.manuscripts | Not Applicable | en_US |
dc.contributor.copyright-release | Not Applicable | en_US |