The Game of Maundy Block
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32797
The Game of Maundy Block

Authors: Alessandro Cincotti

Abstract:

The game of Maundy Block is the three-player variant of Maundy Cake, a classical combinatorial game. Even though to determine the solution of Maundy Cake is trivial, solving Maundy Block is challenging because of the identification of queer games, i.e., games where no player has a winning strategy.

Keywords: Combinatorial game, Maundy Cake, Three-player partizan games.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1075416

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1466

References:


[1] E. R. Berlekamp, J. H. Conway, R. K. Guy, Winning Ways For Your Mathematical Plays, 2nd ed. Natick, Massachusetts: A K Peters, 2001.
[2] A. Cincotti, "Three-player partizan games," Theoretical Computer Science, vol. 332, pp. 367-389, 2005.
[3] J. H. Conway, On Numbers and Games, 2nd ed. Natick, Massachusetts: A K Peters, 2001.
[4] J. Propp, "Three-player impartial games," Theoretical Computer Science, vol. 233, pp. 263-278, 2000.