Abstract: The alpha-beta technique for searching game trees is analyzed, in an attempt to provide some insight into its behavior. The first portion of this paper is an expository presentation of the method together with a proof of its correctness and a historical discussion. The alpha-beta procedure is shown to be optimal in a certain sense, and bounds are obtained for its running time with various kinds of random data.
Publication Year: 1975
Publication Date: 1975-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 935
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot