Abstract
It is well known that minimax search using a heuristic evaluation function is a successful technique in computer game-playing, and yet mathematical models have failed to confirm this observation theoretically. This paper presents a model for which lookahead can be shown beneficial under some conditions. A simple but practical chess endgame is used to illustrate. Finally, locked-value search is introduced as a method of increasing confidence in evaluations for a given heuristic function.
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.
