Counting Domineering Positions

zbMath1466.91061arXiv1909.12419MaRDI QIDQ4989362

Neil A. McKay, Svenja Huntemann

Publication date: 25 May 2021

Full work available at URL: https://arxiv.org/abs/1909.12419

zbMATH Keywords

enumerationmatchingsgrid graphcombinatorial gamedomineering

Mathematics Subject Classification ID

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

Related Items (1)

The Polynomial Profile of Distance Games on Paths and Cycles

Uses Software

• OEIS

Cites Work

• Enumerating independent vertex sets in grid graphs
• Snakes in Domineering games
• Enumeration by kernel positions
• Blockbusting and domineering
• Paving the chessboard
• The Go polynomials of a graph.
• State matrix recursion method and monomer-dimer problem
• \(11\times 11\) Domineering is solved: the first player wins
• On the number of go positions on lattice graphs
• Maximal independent sets on a grid graph
• Games and Complexes I: Transformation via Ideals
• Combinatorics of Go
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting Domineering Positions