Proceedings

Searching to Variable Depth in Computer Chess

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 760-761.

Abstract

This paper discusses some methods for guiding thesearch of conven tional chess programs to variable depth. The motivation for investigating such methods comes from the fact that sea r ching t o a fixed depth causes difficul t problems (e.g. the horizon effect). The first section deals with cer tain improvements of the quiescence search and a demonstration of their beneficial effects. The method of not coun ting moves as a ply of depth is investigated then and the results of extending it somewhat are reported. As thi s method seems to be too sim-ple nevertheless, a more general model for extending the hori zon of the full-width search to variable depth is proposed.

  1. Adelson-Velskiy, G.M., V.L.Arlazarov and M.V.Donskoy "Some Methods of Controlling the Tree Search in Chess Programs" Artificial Intelligence 6 (197 5) 361-371.
  2. Berliner, H.J. "Some Necessary Conditions for a Master Chess Program" In Proc. IJCAl-73. Stanford, August, 197 3, pp. 77-85. IJCAI
  3. Berliner, H.J. "Chess as problem solving: The develop- ment of a tactics analyser". Ph.D.Dissertation. Comp. Science Dep., Carnegie-Mellon Univ. Pittsburgh, 1974.
  4. Berliner, H.J. "An Examination of Brute Force Intelli- gence" In Proc. IJCAI-81. Vancouver, August, 1981, pp. 581-587. IJCAI
  5. Berliner, H.J., Personal communication, Jan. 5, 1983.
  6. Condon, J.H. and K.Thompson, "Belle Chess Hardware" In Advances in Computer Chess 3 (ed.
  7. M.R.B.Clarke), Pergamon Press, 1982.
  8. Kaindl, H. "Positional long-range planning in computer chess" In Advances in Computer Chess 3 (ed.
  9. M.R.B. Clarke), Pergamon Press, 1982.
  10. Kaindl, H. "Realisierung von langfristigem Planen und Massnahmen gegen den Horizont-Effekt im Computer- Schach". Doctoral Dissertation. TU of Vienna, 1981.
  11. Kaindl, H. "Quiescence Search in Computer Chess" SIGART Newsletter 80 (1982) 124-131.
  12. Kaindl, H. "Dynamic Control of the Quiescence Search in Computer Chess" In Proc. EMCSR-82. Vienna, Austria, April, 1982, pp. 973-978.
  13. Knuth, D.E. and R. W .Moore, "An Analysis of Alpha- Beta Pruning" Artificial Intelligence 6 (197 5) 293-326.
  14. Wilkins, D. "Using Patterns and Plans in Chess" Artificial Intelligence 14 (1980) 165-203.
  15. Wilkins, D. "Using Knowledge to Control Tree Searching" Artificial Intelligence 18 (1982) 1-51.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards