pith. sign in

https://en.wikipedia.org/wiki/Negamax (2025), [Online; accessed 09-June-2025]

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.AI 1

years

2025 1

verdicts

ACCEPT 1

representative citing papers

Formal Verification of Minimax Algorithms

cs.AI · 2025-09-24 · accept · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Formal Verification of Minimax Algorithms cs.AI · 2025-09-24 · accept · full · ref 11

    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.