Non-cooperative Monomino Games
In this paper we study monomino games. These are two player games played on a rectangular board with R rows and C columns. The game pieces are monominoes, which cover exactly one cell of the board. One by one each player selects a column of the board, and places a monomino in the lowest uncovered cell. This generates a payoff for the player. The game ends if all cells are covered by monominoes. The goal of each player is to place his monominoes in such a way that his total payoff is maximized. We derive the equilibrium play and corresponding payoffs for the players.
KeywordsMonomino games Non-cooperative games Nash equilibrium Pure strategies
2010 AMS Subject classification:91A10 91A05
- 4.van Dorenvanck, P., Klomp, J.: Optimale strategieën in dominospelen. M.Sc. thesis, University of Twente, Enschede, The Netherlands (2010). (In Dutch)Google Scholar
- 5.Fraenkel, A.S.: Combinatorial games: Selected bibliography with a succinct gourmet introduction. The Electronic Journal of Combinatorics, Dynamic Surveys, DS2 (2009)Google Scholar
- 8.Orman, H.K.: Pentominoes: a first player win. In: Nowakowski, R.J. (ed.) Games of No Chance, MSRI Publications, vol. 29, pp. 339–344. Cambridge University Press, Cambridge (1996)Google Scholar