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.
[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.
[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.
@article{"International Journal of Engineering, Mathematical and Physical Sciences:59587", author = "Alessandro Cincotti", title = "The Game of Maundy Block", 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.", volume = "1", number = "8", pages = "368-4", }