Domineering games with minimal number of moves

arXiv2005.02796MaRDI QIDQ6340157

Siddharth Sinha, Rohan Karthikeyan

Publication date: 6 May 2020

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 $mimesn$ boards. We also formulate two problems pertaining to patterns found in the obtained results.

Has companion code repository: https://github.com/RohanKarthikeyan/Domineering

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

This page was built for publication: Domineering games with minimal number of moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340157)