Abstract
AbstractTwo‐person zero‐sum games with perfect information can be represented by minimax game trees. By solving such game trees, it is possible to compute the game values that are realized when both players always choose the best moves. Various search algorithms, such as α ‐β, SSS*, dual SSS*, B*, H*, are known for this purpose. Let A and B be two search algorithms; A surpasses B if, for any game tree, the region explored by A before computing the game value is contained in the region explored by B; A strictly surpasses B if A surpasses B and the region explored by A is properly contained in the region explored by B for at least one game tree. In this paper, we prove that no search algorithm strictly surpasses SSS* or dual SSS*.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
