An update on Domineering on rectangular boards

MaRDI QIDQ2926286zbMATH OpenFDO

Authors Gabriel C. Drummond-Cole

Publication date 23 October 2014

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.3257, http://www.emis.de/journals/INTEGERS/papers/og3/og3.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorial game theoryDomineeringdominogame of no chancerectangular board

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

Abstract: Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note, we review previous work, establish the outcome classes for several dimensions of rectangular board, and restrict the outcome class in several more.

Review text

Domineering, invented by Göran Andersson and popularized by Martin Gardner, is a finite drawless turn-based perfect information game of no chance played on a rectangular grid of squares between two players. The players take turns placing dominoes on unoccupied squares of the board. Each domino covers two adjacent squares. One player, called Vertical, must place her dominoes in a ``vertical orientation. The other, called Horizontal, places hers in a ``horizontal orientation. When a player has no legal move on her turn, she loses.NEWLINENEWLINE\textit{E. R. Berlekamp} [J. Comb. Theory, Ser. A 49, No. 1, 67--116 (1988; Zbl 0651.90092)] engaged in the first systematic research into the outcome classes of rectangular boards. In this paper, using computer programs, the outcome classes for several dimensions of rectangular board are given. Outcome classes for boards of certain fixed small widths and results for boards of dimension \(n\times 2n\) are discussed.

Recommendations

• Misère domineering on \(2 \times n\) boards
• Misère domineering on 2 n boards
• Domination in chessboards
• scientific article; zbMATH DE number 7714498
• Rook domination on hexagonal hexagon boards
• Rook domination on hexagonal hexagon boards
• scientific article; zbMATH DE number 90561
• scientific article; zbMATH DE number 1944404
• On bounds for a board covering problem

Cited in

(18)

• Noncooperative monomino games
• Solving \(8\times 8\) Domineering
• \(11\times 11\) Domineering is solved: the first player wins
• Predominance game
• Tromping games: tiling with trominoes
• New solutions for Synchronized Domineering
• scientific article; zbMATH DE number 988838 (Why is no real title available?)
• Misère domineering on \(2 \times n\) boards
• Mu Torere: An Analysis of a Maori Game
• scientific article; zbMATH DE number 1944391 (Why is no real title available?)
• scientific article; zbMATH DE number 1944404 (Why is no real title available?)
• scientific article; zbMATH DE number 1472125 (Why is no real title available?)
• Counting domineering positions
• New results for Domineering from combinatorial game theory endgame databases
• Misère domineering on 2 n boards
• Board Structures Around the World: an Experimental Investigation*
• scientific article; zbMATH DE number 2214425 (Why is no real title available?)
• Snakes in Domineering games

This page was built for publication: An update on Domineering on rectangular boards

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