Counting domineering positions

MaRDI QIDQ4989362zbMATH OpenFDO

Authors Svenja Huntemann, Neil A. McKay

Publication date 25 May 2021

Full work available at URL https://arxiv.org/abs/1909.12419, https://cs.uwaterloo.ca/journals/JIS/VOL24/Huntemann/hunt2.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

enumerationmatchingscombinatorial gamegrid graphdomineering

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Abstract: Domineering is a two player game played on a checkerboard in which one player places dominoes vertically and the other places them horizontally. We give bivariate generating polynomials enumerating Domineering positions by the number of each player's pieces. We enumerate all positions, maximal positions, and positions where one player has no move. Using these polynomials we count the number of positions that occur during alternating play. Our method extends to enumerating positions from mid-game positions and we include an analysis of a tournament game.

Recommendations

• scientific article; zbMATH DE number 1944404
• An update on Domineering on rectangular boards
• Snakes in Domineering games
• scientific article; zbMATH DE number 2214425
• Misère domineering on \(2 \times n\) boards

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 2115805 (Why is no real title available?)
• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• A note on polynomial profiles of placement games
• Blockbusting and domineering
• Combinatorial game theory
• Combinatorics of Go
• Enumerating independent vertex sets in grid graphs
• Enumeration by kernel positions
• Games and complexes. I: Transformation via ideals
• Maximal independent sets on a grid graph
• On the number of go positions on lattice graphs
• Paving the chessboard
• Snakes in Domineering games
• State matrix recursion method and monomer-dimer problem
• The Go polynomials of a graph.
• The game of timber!
• \(11\times 11\) Domineering is solved: the first player wins

Cited in

(12)

• Misère domineering on \(2\times n\) boards
• The polynomial profile of distance games on paths and cycles
• A note on polynomial profiles of placement games
• Polymerization and crystallization of snowflake molecules in Domineering
• scientific article; zbMATH DE number 2214427 (Why is no real title available?)
• Predominance game
• Snakes in Domineering games
• Misère domineering on \(2 \times n\) boards
• Blockbusting and domineering
• scientific article; zbMATH DE number 2214425 (Why is no real title available?)
• The average size of maximal matchings in graphs
• Toppling conjecture

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting domineering positions

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