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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Anzen introduces three unequivocal assignment operators and a type-capability system for uniqueness and immutability, formalized via minimal calculus.
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.
-
Explicit and Controllable Assignment Semantics
Anzen introduces three unequivocal assignment operators and a type-capability system for uniqueness and immutability, formalized via minimal calculus.