Domineering games with minimal number of moves

Abstract

Domineering is a two-player game played on a checkerboard in which one player places dominoes vertically, while the other places them horizontally. In this paper, we find out the minimum number of moves for a game of Domineering to end on several rectangular $m\times n$ boards. We also formulate two problems pertaining to patterns found in the obtained results.

arXiv comment6 pages; corrected results section, added figures

References in corpus (1)

• Counting Domineering Positions