4 research outputs found
New Results for Domineering from Combinatorial Game Theory Endgame Databases
We have constructed endgame databases for all single-component positions up
to 15 squares for Domineering, filled with exact Combinatorial Game Theory
(CGT) values in canonical form. The most important findings are as follows.
First, as an extension of Conway's [8] famous Bridge Splitting Theorem for
Domineering, we state and prove another theorem, dubbed the Bridge Destroying
Theorem for Domineering. Together these two theorems prove very powerful in
determining the CGT values of large positions as the sum of the values of
smaller fragments, but also to compose larger positions with specified values
from smaller fragments. Using the theorems, we then prove that for any dyadic
rational number there exist Domineering positions with that value.
Second, we investigate Domineering positions with infinitesimal CGT values,
in particular ups and downs, tinies and minies, and nimbers. In the databases
we find many positions with single or double up and down values, but no ups and
downs with higher multitudes. However, we prove that such single-component ups
and downs easily can be constructed. Further, we find Domineering positions
with 11 different tinies and minies values. For each we give an example. Next,
for nimbers we find many Domineering positions with values up to *3. This is
surprising, since Drummond-Cole [10] suspected that no *2 and *3 positions in
standard Domineering would exist. We show and characterize many *2 and *3
positions. Finally, we give some Domineering positions with values interesting
for other reasons.
Third, we have investigated the temperature of all positions in our
databases. There appears to be exactly one position with temperature 2 (as
already found before) and no positions with temperature larger than 2. This
supports Berlekamp's conjecture that 2 is the highest possible temperature in
Domineering
Master index
Pla general, del mural cerĂ mic que decora una de les parets del vestĂbul de la Facultat de QuĂmica de la UB. El mural representa diversos sĂmbols relacionats amb la quĂmica
Games, puzzles, and computation
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (p. 147-153).There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea of game as computation to a greater degree than has been done previously. I present a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games. A deterministic version of Constraint Logic corresponds to a novel kind of logic circuit which is monotone and reversible. At the other end of the spectrum, I show that a multiplayer version of Constraint Logic is undecidable. That there are undecidable games using finite physical resources is philosophically important, and raises issues related to the Church-Turing thesis. In the second half of this thesis, I apply the Constraint Logic formalism to many actual games and puzzles, providing new hardness proofs. These applications include sliding-block puzzles, sliding-coin puzzles, plank puzzles, hinged polygon dissections, Amazons, Kohane, Cross Purposes, Tip over, and others.(cont.) Some of these have been well-known open problems for some time. For other games, including Minesweeper, the Warehouseman's Problem, Sokoban, and Rush Hour, I either strengthen existing results, or provide new, simpler hardness proofs than the original proofs.by Robert Aubrey Hearn.Ph.D