Automatic proofs in combinatorial game theory

DOI10.1007/S00182-025-00953-3MaRDI QIDQ6917685zbMATH OpenFDO

Authors Bastien Mignoty, Antoine Renard, Michel Rigo, Markus A. Whiteland

Publication date 13 October 2025

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00182-025-00953-3

zbMATH Keywords

automatic theorem provingcombinatorial game theoryfirst-order logicnumeration systemsWythoff's game

Mathematics Subject Classification ID

Other number representations (11A67) Formal languages and automata (68Q45) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) 2-person games (91A05) Combinatorial games (91A46)

Cites work

• A generalized diagonal Wythoff Nim
• A modification of the game of Nim.
• An aperiodic subtraction game of Nim-dimension two
• Automatic Sequences
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• Enumeration and decidable properties of automatic sequences
• Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
• Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
• From combinatorial games to shape-symmetric morphisms
• Geometric analysis of a generalized Wythoff game
• Heap games, numeration systems and sequences
• How to Beat Your Wythoff Games' Opponent on Three Fronts
• scientific article; zbMATH DE number 6720718 (Why is no real title available?)
• scientific article; zbMATH DE number 5707089 (Why is no real title available?)
• scientific article; zbMATH DE number 2124102 (Why is no real title available?)
• scientific article; zbMATH DE number 891076 (Why is no real title available?)
• scientific article; zbMATH DE number 1400048 (Why is no real title available?)
• scientific article; zbMATH DE number 3397597 (Why is no real title available?)
• Invariant games
• Linear recurrence sequence automata and the addition of abstract numeration systems
• Logic and p-recognizable sets of integers
• Maharaja Nim: Wythoff's queen meets the knight
• On synchronized sequences and their separators
• On the numeration system of Ostrowski
• Ostrowski-automatic sequences: theory and applications
• Proof of Irvine's conjecture via mechanized guessing
• Queen reflections: a modification of Wythoff Nim
• Representations of numbers and finite automata
• Some tribonacci conjectures
• Synchronized sequences
• The Logical Approach to Automatic Sequences
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.
• Two variants of Wythoff's game preserving its P-positions
• Using automata and a decision procedure to prove results in pattern matching (invited talk)
• Wythoff visions

Cited in

(1)

• Variants of Wythoff game with terminal positions or blocking maneuvers

This page was built for publication: Automatic proofs in combinatorial game theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917685)