@inproceedings{JunghannsSBBM97,
  title =	{Diminishing Returns for Additional Search in Chess},
  author =	{Andreas Junghanns and Jonathan Schaeffer and Mark
		 Brockington and Yngvi Bj{\"o}rnsson and Tony Marsland},
  year = 	{1997},
  booktitle=ACC8,
  abstract =	{Advances in technology allow for increasingly deeper
		 searches in competitive chess programs. Several
		 experiments with chess indicate a constant improvement
		 in a program 's performance for deeper searches; a
		 program searching to depth d + 1 scores roughly 80 percent
		 the possible points in a match with a program searching
		 to depth d. In other board games, such as Othello and
		 checkers, additional plies of search translated into
		 decreasing benefits, giving rise to diminishing returns
		 for deeper searching. This paper demonstrates that
		 there are diminishing returns in chess. However, the
		 high percentage of errors made by chess programs for
		 search depths through 9 ply hides the effect. 1
		 Introduction It is common knowledge that chess program
		 performance is strongly correlated to the depth of the
		 search tree explored by the program. Deeper searching
		 can be achieved in several ways, including more
		 efficient search algorithms (smaller search trees),
		 forward pruning (with the possibility of introduc..."},
 bib2html_pubtype = {Refereed Conference},
  bib2html_rescat = {Search, Games}
}