Hints and tips:
  • You may need to look up some unfamiliar terms in the title or description to get more of a sense of what is involved.
  • If the project has "No" in the "Current Availability:" field, it is already taken or not being offered this academic year but may be available again in future years.
  • The supervisor name links to a contact details webpage so, if you are interested, you can arrange to discuss this project or even propose a related topic of your own.
Level: BSc, MSci, MSc
Title: Combinatorial game theory
Supervisor:

Dr Alex Fink
Research Area: Algebra
Description:

A combinatorial game is one in which there is no chance or hidden information, so that in theory, with enough computation, you could work out who would win if both players played perfectly. Familiar examples range from noughts and crosses to chess and go. In this project, you will learn about the algebraic structures which arise in analysing these games, such as the surreal numbers, a field containing the real numbers as well as diverse infinities and infinitesimals.

Specializations of this could be developed as MSc projects. One possibility involves proving some observations about growth rate of misère quotients (misère games are those where the last player loses).
Further Reading:
  • E. Berlekamp, J. H. Conway, R. K. Guy, Winning ways for your mathematical plays. Second edition. A K Peters Ltd., 2001–2004.
  • A. Siegel, Combinatorial game theory. Graduate Studies in Mathematics, Vol. 146, American Mathematical Society, 2013.
Key Modules:

MTH5100 Algebraic Structures I

MTH6104 Algebraic Structures II
Other Information:
Current Availability: Yes