Misère domineering on 2 n boards
From MaRDI portal
Recommendations
Cites work
- \(11\times 11\) Domineering is solved: the first player wins
- Blockbusting and domineering
- Dead ends in misère play: the misère monoid of canonical numbers
- scientific article; zbMATH DE number 6490897 (Why is no real title available?)
- scientific article; zbMATH DE number 1944404 (Why is no real title available?)
- scientific article; zbMATH DE number 5171562 (Why is no real title available?)
- Misère quotients for impartial games
- Solving \(8\times 8\) Domineering
Cited in
(17)- New values in Domineering
- Solving \(8\times 8\) Domineering
- \(11\times 11\) Domineering is solved: the first player wins
- The invertible elements of the monoid of dead-ending misère games
- On supplements of 2 m board in Toppling Towers
- Predominance game
- An update on Domineering on rectangular boards
- Tromping games: tiling with trominoes
- scientific article; zbMATH DE number 988824 (Why is no real title available?)
- scientific article; zbMATH DE number 565993 (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
- scientific article; zbMATH DE number 2214425 (Why is no real title available?)
- Snakes in Domineering games
This page was built for publication: Misère domineering on \(2 \times n\) boards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390724)
