• DOI:10.1016/B978-0-08-026898-9.50005-X
Corpus ID: 59646292

BENEFITS OF MINIMAX SEARCH

@inproceedings{Beal1982BENEFITSOM,
  title={BENEFITS OF MINIMAX SEARCH},
  author={D. F. Beal},
  year={1982}
}

D. F. Beal

Published 1982

Computer Science

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed

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.