BENEFITS OF MINIMAX SEARCH

@inproceedings{Beal1982BENEFITSOM,
  title={BENEFITS OF MINIMAX SEARCH},
  author={D. F. Beal},
  year={1982}
}
  • D. F. Beal
  • Published 1982
  • Computer Science
  • 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. 
    30 Citations
    Minimax Pathology and Real-Number Minimax Model
    • 3
    • PDF
    Recent progress in understanding minimax search
    • D. F. Beal
    • Mathematics, Computer Science
    • ACM '83
    • 1983
    • 5
    Is real-valued minimax pathological?
    • 20
    • PDF
    Accuracy and Savings in Depth-Limited Capture Search
    • 7
    • PDF
    Why Minimax Works: An Alternative Explanation
    • 16
    • PDF
    SEARCH VS KNOWLEDGE: EMPIRICAL STUDY OF MINIMAX ON KRK ENDGAME
    • 5
    • PDF
    Minimaxing: Theory and Practice
    • 22
    • PDF
    Reasons for the effects of bounded look-ahead search
    • 10
    Bias and pathology in minimax search
    • 16
    • Highly Influenced
    • PDF

    References

    Decision Quality As a Function of Search Depth on Game Trees
    • D. Nau
    • Computer Science
    • JACM
    • 1983
    • 46
    • PDF