Why minimax works: An alternative explanation

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 212-217

  Luštrek, Mitja ^a   Gams, Matjaž ^a   Bratko, Ivan ^b  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

GAME TREES; GAME-PLAYING PROGRAMS; HEURISTIC FUNCTIONS; MINIMAX; MINIMAX PRINCIPLE; POSITION VALUE; PROBABILITY OF ERRORS; REAL NUMBER;

ARTIFICIAL INTELLIGENCE; FORESTRY; HEURISTIC ALGORITHMS; PATHOLOGY;

TREES (MATHEMATICS);

EID: 33750708410     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Don F. Beal. An analysis of minimax. In Advances in Computer Chess 2, pages 103-109, 1980. Edinburgh University Press.
2. Don F. Beal. Benefits of minimax search. In Advances in Computer Chess 3, pages 17-24, 1982. Pergamon Press.
3. Ivan Bratko and Matjaž Gams. Error analysis of the minimax principle. In Advances in Computer Chess 3, pages 1-15, 1982. Pergamon Press.
4. Mitja Luštrek. Minimax pathology and real-number minimax model. In Proceedings of the Thirteenth International Electrotechnical and Computer Science Conference, Volume B, pages 137-140, Portorož, Slovenia, September 2004. Slovenian Section IEEE.
5. Gerrard P. Michon. Recursive Random Games: A probabilistic model for Perfect Information Games. Ph.D. thesis, University of California, Los Angeles, 1983.
6. Dana S. Nau. Quality of decision versus depth of search on game trees. Ph.D. thesis, Duke University, 1979.
7. Dana S. Nau. An investigation of the causes of pathology in games. Artificial Intelligence, 19(3): 257-278, November 1982.
8. Judea Pearl. On the nature of pathology in game searching. Artificial Intelligence, 20(4): 427-453, July 1983.
9. Aleksander Sadikov, Ivan Bratko, and Igor Kononenko. Search vs knowledge: Empirical study of minimax on KRK endgame. In Advances in Computer Games: Many Games, Many Challenges, pages 33-44, 2003. Kluwer Academic Publishers.
10. Anton Scheucher and Hermann Kaindl. Benefits of using multivalued functions for minimaxing. Artificial Intelligence, 99(2): 187-208, March 1998.