Solving 8 x 8 Domineering

DM Breuker, JWHM Uiterwijk*, HJ van den Herik

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

18 Citations (Web of Science)

Abstract

So far the game of Domineering has mainly been investigated by combinatorial-games researchers. Yet, it is a genuine two-player zero-sum game with perfect information, of which the general formulation is a topic of AI research. In that domain, many techniques have been developed for two-person games, especially for chess. In this article we show that one such technique, i.e., transposition tables, is fit for serving standard Domineering (i.e., on an 8x8 board). The game turns out to be a win for the player first to move. This result coincides with a result obtained independently by Morita Kazuro. Moreover, the technique of transposition tables is also applied to differently sized m x n boards, m ranging from 2 to 8, and n from m to 9. The results are given in tabular form. Finally, some conclusions on replacement schemes are drawn. In an appendix an analysis of four tournament games is provided.
Original languageEnglish
Pages (from-to)195-206
JournalTheoretical Computer Science
Volume230
Issue number1-2
DOIs
Publication statusPublished - 6 Jan 2000

Keywords

  • Domineering
  • solving games
  • transposition tables
  • replacement schemes

Cite this