@inproceedings{b914cf01c4c7451a8665c79561c70a5d,
title = "Alpha-Beta Pruning Verified",
abstract = "Alpha-beta pruning is an efficient search strategy for two-player game trees. It was invented in the late 1950s and is at the heart of most implementations of combinatorial game playing programs. We have formalized and verified a number of variations of alpha-beta pruning, in particular fail-hard and fail-soft, and valuations into linear orders, distributive lattices and domains with negative values.",
keywords = "Algorithmic Game Theory, Isabelle, Verification",
author = "Tobias Nipkow",
note = "Publisher Copyright: {\textcopyright} 2024 Tobias Nipkow.; 15th International Conference on Interactive Theorem Proving, ITP 2024 ; Conference date: 09-09-2024 Through 14-09-2024",
year = "2024",
month = sep,
doi = "10.4230/LIPIcs.ITP.2024.1",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Yves Bertot and Temur Kutsia and Michael Norrish",
booktitle = "15th International Conference on Interactive Theorem Proving, ITP 2024",
}