Short games #
A combinatorial game is Short if it has only finitely many subpositions. In particular, this means
there is a finite set of moves at every point.
We historically defined Short x as data, which we then used to enable some degree of computation
on combinatorial games. This functionality is now implemented through the game_cmp tactic instead.
@[irreducible]
Equations
- x.ShortAux = ∀ (p : Player), (IGame.moves p x).Finite ∧ ∀ y ∈ IGame.moves p x, y.ShortAux
Instances For
A short game is one with finitely many subpositions. That is, the left and right sets are finite, and all of the games in them are short as well.
- of_shortAux :: (
- out : x.ShortAux
- )
Instances
short eagerly adds all possible Short hypotheses.
Equations
- IGame.Short.tacticShort = Lean.ParserDescr.node `IGame.Short.tacticShort 1024 (Lean.ParserDescr.nonReservedSymbol "short" false)
Instances For
Alias of IGame.Short.isOption.
@[irreducible]
Alias of IGame.Short.subposition.