Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Perfectly Solving Domineering Boards
verfasst von : Jos W. H. M. Uiterwijk
Erschienen in: Computer Games
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this paper we describe the perfect solving of rectangular empty Domineering boards. Perfect solving is defined as solving without any search. This is done solely based on the number of various move types in the initial position. For this purpose we first characterize several such move types. Next we define 12 knowledge rules, of increasing complexity. Of these rules, 6 can be used to show that the starting player (assumed to be Vertical) can win a game against any opposition, while 6 can be used to prove a definite loss (a win for the second player, Horizontal).
Applying this knowledge-based method to all 81 rectangular boards up to \(10 \times 10\) (omitting the trivial \(1 \times n\) and \(m \times 1\) boards), 67 could be solved perfectly. This is in sharp contrast with previous publications reporting the solution of Domineering boards, where only a few tiny boards were solved perfectly, the remainder requiring up to large amounts of search. Applying this method to larger boards with one or both sizes up to 30 solves 216 more boards, mainly with one dimension odd. All results fully agree with previously reported game-theoretic values.
Finally, we prove some more general theorems: (1) all \(m \times 3\) boards (\(m > 1\)) are a win for Vertical; (2) all \(2k \times n\) boards with \(n = 3, 5, 7, 9,\) and \(11\) are a win for Vertical; (3) all \(3 \times n\) boards (\(n > 3\)) are a win for Horizontal; and (4) all \(m \times 2k\) boards for \(m = 5\) and \(9\), all \(m \times 2k\) boards with \(k>1\) for \(m = 3\) and \(7\), and all \(11 \times 4k\) boards are a win for Horizontal.