Minimaxing: Theory and Practice

@article{Kaindl1988MinimaxingTA,
  title={Minimaxing: Theory and Practice},
  author={Hermann Kaindl},
  journal={AI Magazine},
  year={1988},
  volume={9},
  pages={69-76}
}
here is a bounded look-ahead to artificial terminal nodes. Except in very rare cases such as the game nim, there is no known way of directly evaluating the exact status (the true value) of such artificial terminal nodes. Consequently the use of heuristic estimates is usually the only practical resort. Such heuristic values are assigned by so-called static evaluation functions. In practical applications these heuristic values are usually not restricted to the game-theoretic values, but range… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

When Does “Knowing More is Less” Happen in Real Games

2018 37th Chinese Control Conference (CCC) • 2018
View 8 Excerpts
Highly Influenced

Adversarial Search by Evolutionary Computation

Evolutionary Computation • 2001
View 4 Excerpts
Highly Influenced

“knowing more is less” in combinatorial games

Proceedings of the 10th World Congress on Intelligent Control and Automation • 2012
View 1 Excerpt

A Shogi-Computer Test Set

ACM Conference on Computer Science • 1996
View 2 Excerpts

Beyond minimaxing for games with draws

ACM Conference on Computer Science • 1991
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 26 references

On the Nature of Pathology in Game Searching

J. Pearl
Artificial Intelligence 20(4): 427-453. • 1983
View 4 Excerpts
Highly Influenced

An Investigation of the Causes of Pathology in Games

Artif. Intell. • 1982
View 7 Excerpts
Highly Influenced

On game graph structure and its influence on pathology

International Journal of Computer & Information Sciences • 1983
View 9 Excerpts
Highly Influenced

Pathology on Game Trees Revisited, and an Alternative to Minimaxing

Artif. Intell. • 1983
View 9 Excerpts
Highly Influenced

Quiescence Search in Computer Chess

H. Kaindl
Computer Game-Playing: Theory and Practice, 39-52. Chich- • 1983
View 6 Excerpts
Highly Influenced

Recent progress in understanding minimax search

ACM Annual Conference • 1983
View 3 Excerpts
Highly Influenced

Recursive Random Games: A Probabilistic Model for Perfect Information Games

G. Michon
Ph.D. diss., Univ. of California at Los Angeles. • 1983
View 3 Excerpts
Highly Influenced

The Rating of Chess Players, Past and Present

A. Elo
London: Batsford. • 1978
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…