This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment' s simulations were performed upon the KRK chess endgame. Our results show that dependencies between evaluations of sibling nodes in a game tree and an abundance of possibilities to commit blunders present in the KRK endgame are not sufficient to explain the success of the minimax principle in practicat game-playing as was previously believed. The article shows that minimax in combination with a noisy evaluation function introduces a bias into the backed-up evaluations and argues that this bias is what masked the effectiveness of the minimax in previous studies. © 2004 by Springer Science+Business Media New York.
CITATION STYLE
Sadikov, A., Bratko, I., & Kononenko, I. (2004). Search versus knowledge: An empirical study of minimax on KRK. In IFIP Advances in Information and Communication Technology (Vol. 135, pp. 33–44). Springer New York LLC. https://doi.org/10.1007/978-0-387-35706-5_3
Mendeley helps you to discover research relevant for your work.