The authors formally verify several minimax variants with alpha-beta and transposition tables in Dafny, proving one depth-limited negamax variant correct under a new witness-based criterion and exhibiting a counterexample for another.
SIGART Newsl.72, 29–31 (1980)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Formal Verification of Minimax Algorithms
The authors formally verify several minimax variants with alpha-beta and transposition tables in Dafny, proving one depth-limited negamax variant correct under a new witness-based criterion and exhibiting a counterexample for another.