Skip to main content

Innovative Opening-Book Handling

  • Conference paper
Advances in Computer Games (ACG 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4250))

Included in the following conference series:

Abstract

The best chess programs have reached the level of top players in the human chess world. The so-called opening books, which are databases containing thousands of Grandmaster games, have been seen as a big advantage of programs over humans, because the computers do never forget a variation. Interestingly, it is this opening phase which causes most problems for the computers. Not because they do not understand openings in general, but because the opening books contain too much rubbish. We introduce a heuristic which explores the database during a game. Without that, the computer repeats failures of weaker players. Our contribution presents best practice.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Althöfer, I.: Root Evaluation Errors: How they Arise and Propagate. ICCA Journal 11(3), 55–63 (1988)

    Google Scholar 

  2. Beal, D.F.: An Analysis of Minimax. In: Clarke, M.R.B. (ed.) Advances in Computer Chess 2, pp. 103–109. Edinburgh University Press (1980)

    Google Scholar 

  3. Buro, M.: The Othello Match of the Year: Takeshi Murakami vs. Logistello. ICCA Journal 20(3), 189–193 (1997)

    Google Scholar 

  4. Buro, M.: Towards Opening Book Learning. ICCA Journal 22(2), 98–102 (1999)

    Google Scholar 

  5. Condon, J.H., Thompson, K.: Belle Chess Hardware. In: Beal, D.F. (ed.) Advances in Computer Chess 5, pp. 44–54. Pergamon Press, Oxford (1982)

    Google Scholar 

  6. Donninger, C., Lorenz, U.: The Chess Monster HYDRA. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 927–932. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Feldmann, R., Monien, B., Mysliwietz, P., Vornberger, O.: Distributed Game Tree Search. In: Parallel Algorithms for Machine Intelligence and Vision, pp. 66–101. Springer, Heidelberg (1990)

    Google Scholar 

  8. Ferguson, C., Korf, R.E.: Distributed Tree Search and Its Applications to Alpha-Beta Pruning. In: Proceedings of the 7th National Conference Artificial Intelligence, pp. 128–132 (1988)

    Google Scholar 

  9. van den Herik, H.J.: The World Chess Team Championship Man vs. Machine. ICGA Journal 27(4), 246–248 (2004)

    Google Scholar 

  10. Hsu, F.H.: Large Scale Parallelization of Alphabeta Search: An Algorithmic and Architectural Study with Computer Chess. PhD thesis, Carnegie-Mellon University, Pittsburgh (1990)

    Google Scholar 

  11. Iida, H., Uiterwijk, J.W.H.M., van den Herik, H.J., Herschberg, I.S.: Potential Applications of Opponent-Model Search. Part 2: Risks and Strategies. ICCA Journal 17(1), 10–15 (1994)

    Google Scholar 

  12. Knuth, D.E., Moore, R.W.: An Analysis of Alphabeta Pruning. Artificial Intelligence 6(4), 293–326 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  13. Levy, D.N.L.: The 2nd Bilbao Man vs. Machine Team Championship. ICGA Journal 28(4), 254–255 (2005)

    Google Scholar 

  14. Levy, D., Newborn, M.: How Computers Play Chess. W.H. Freeman and Company, New York (1990)

    Google Scholar 

  15. Marsland, T.A., Reinefeld, A., Schaeffer, J.: Multiprocessor Tree-Search Experiments. Artificial Intelligence 31(1), 185–199 (1987)

    Article  Google Scholar 

  16. Nau, D.S.: An Investigation of the Causes of Pathology in Games. Artificial Intelligence 19(3), 257–278 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  17. Meyer-Kahlen, S., Feist, M., Morsch, F., Kure, A., Günes, E., Lutz, C., de Gorter, C.: Personal communication (2000–2003)

    Google Scholar 

  18. Plaat, A., Schaeffer, J.: Kasparov vs. Deep Blue: The Rematch. ICCA Journal, 95–101 (1997)

    Google Scholar 

  19. Schaeffer, J., Lake, R., Lu, P., Bryant, M.: Chinook: The World Man-Machine Checkers Champion. AI Magazine 17(1), 21–29 (1996)

    Google Scholar 

  20. Shannon, C.E.: Programming a Computer for Playing Chess. Philosophical Magazine 41(314), 256–275 (1950)

    MATH  MathSciNet  Google Scholar 

  21. Uiterwijk, J.W.H.M., van den Herik, H.J., Allis, L.V.: A Knowledge-Based Approach to Connect-4. The Game is Over: White To Move Wins. Heuristic Programming in Artificial Intelligence I, 113–133 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Donninger, C., Lorenz, U. (2006). Innovative Opening-Book Handling. In: van den Herik, H.J., Hsu, SC., Hsu, Ts., Donkers, H.H.L.M.(. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922155_1

Download citation

  • DOI: https://doi.org/10.1007/11922155_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48887-3

  • Online ISBN: 978-3-540-48889-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics