Solving 8 8 Domineering
From MaRDI portal
DOI10.1016/S0304-3975(99)00082-1zbMATH Open0951.91006OpenAlexW1998598348WikidataQ56475438 ScholiaQ56475438MaRDI QIDQ1978509FDOQ1978509
Authors: D. M. Breuker, Jos W. H. M. Uiterwijk, H. J. van den Herik 
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00082-1
Recommendations
Domineeringgenuine two-player zero-sum game with perfect informationreplacement schemessolving gamestransposition tables
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Blockbusting and domineering
- An analysis of alpha-beta pruning
- New values in Domineering
- Snakes in Domineering games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Qubic: 4 × 4 × 4 Tic-Tac-Toe
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Winner determination algorithms for graph games with matching structures
- Winner determination algorithms for graph games with matching structures
- Complexity, appeal and challenges of combinatorial games
- Polymerization and crystallization of snowflake molecules in Domineering
- New results for Domineering from combinatorial game theory endgame databases
- Misère domineering on \(2 \times n\) boards
- Games solved: Now and in the future
- A quantitative study of \(2\times4\) Chinese dark chess
- \(11\times 11\) Domineering is solved: the first player wins
- BEST PLAY IN FANORONA LEADS TO DRAW
- The Game of Synchronized Domineering
This page was built for publication: Solving \(8\times 8\) Domineering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978509)
