arxiv
PublishedApril 23, 2026 at 4:00 AM
—neutral
Formal Verification of Minimax Algorithms
Publisher summary· verbatim
arXiv:2509.20138v2 Announce Type: replace Abstract: Minimax-based search algorithms with alpha-beta pruning and transposition tables are a central component of classical game-playing engines and remain widely used in practice. Despite their widespread use, these algorithms are subtle, highly optimiz
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivReinforcement Learning Towards Broadly and Persistently Beneficial Models6harxivEnsemble Feature Selection and Harris Hawks Optimization for Explainable Mental Health Risk Prediction in Female Sex Workers6harxivReMMD: Realistic Multilingual Multi-Image Agentic Verification for Multimodal Misinformation Detection6harxivVeryTrace: Verifying Reasoning Traces through Compilable Formalism and Structured Verification6hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗