mathlib documentation

set_theory.game.domineering

Domineering as a combinatorial game. #

We define the game of Domineering, played on a chessboard of arbitrary shape (possibly even disconnected). Left moves by placing a domino vertically, while Right moves by placing a domino horizontally.

This is only a fragment of a full development; in order to successfully analyse positions we would need some more theorems. Most importantly, we need a general statement that allows us to discard irrelevant moves. Specifically to domineering, we need the fact that disjoint parts of the chessboard give sums of games.

The embedding (x, y) ↦ (x, y+1).

Equations

The embedding (x, y) ↦ (x+1, y).

Equations

A Domineering board is an arbitrary finite subset of ℤ × ℤ.

Equations

Left can play anywhere that a square and the square below it are open.

Equations

Right can play anywhere that a square and the square to the left are open.

Equations

After Left moves, two vertically adjacent squares are removed from the board.

Equations

After Left moves, two horizontally adjacent squares are removed from the board.

Equations
@[instance]

The instance describing allowed moves on a Domineering board.

Equations

Construct a pre-game from a Domineering board.

Equations
@[instance]

All games of Domineering are short, because each move removes two squares.

Equations

The Domineering board with two squares arranged vertically, in which Left has the only move.

Equations

The L shaped Domineering board, in which Left is exactly half a move ahead.

Equations
@[instance]
Equations