Measuring the performance potential of chess programs
Artificial Intelligence - Special issue on computer chess
Bias and pathology in minimax search
Theoretical Computer Science - Advances in computer games
Increasing efficiency and quality in the automatic composition of three-move mate problems
ICEC'11 Proceedings of the 10th international conference on Entertainment Computing
| Hi-index | 0.00 |
The questions focusing on diminishing returns for additional search effort have been a burning issue in computer chess. Despite a lot of research in this field, there are still some open questions, e.g., what happens at search depths beyond 12 plies, and what is the effect of the program's knowledge on diminishing returns? The paper presents an experiment that attempts to answer these questions. The results (a) confirm that diminishing returns in chess exist, and more importantly (b) show that the amount of knowledge a program has influences when diminishing returns will start to manifest themselves.