Skip to main content

Deriving Concepts and Strategies from Chess Tablebases

  • Conference paper
Advances in Computer Games (ACG 2009)

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

Included in the following conference series:

Abstract

Complete tablebases, indicating best moves for every position, exist for chess endgames. There is no doubt that tablebases contain a wealth of knowledge, however, mining for this knowledge, manually or automatically, proved as extremely difficult. Recently, we developed an approach that combines specialized minimax search with the argument-based machine learning (ABML) paradigm. In this paper, we put this approach to test in an attempt to elicit human-understandable knowledge from tablebases. Specifically, we semi-automatically synthesize knowledge from the KBNK tablebase for teaching the difficult king, bishop, and knight versus the lone king endgame.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Thompson, K.: Retrograde analysis of certain endgames. International Computer Chess Association Journal 9(3), 131–139 (1986)

    Google Scholar 

  2. Roycroft, A.J.: Expert against oracle. In: Hayes, J.E., Michie, D., Richards, J. (eds.) Machine Intelligence, vol. 11, pp. 347–373. Oxford University Press, Oxford (1988)

    Google Scholar 

  3. Nunn, J.: Secrets of Minor-Piece Endings. Batsford (1995)

    Google Scholar 

  4. Nunn, J.: Secrets of Pawnless Endings. Gambit Publications Limited (2002)

    Google Scholar 

  5. Fürnkranz, J.: Machine learning in games: A survey. In: Fürnkranz, J., Kubat, M. (eds.) Machines that Learn to Play Games. Nova Scientific Publishers, New York (2001)

    Google Scholar 

  6. van den Herik, H., Uiterwijk, J., van Rijswijck, J.: Games solved: Now and in the future. Artificial Intelligence 134, 277–311 (2002)

    Article  MATH  Google Scholar 

  7. Možina, M., Guid, M., Krivec, J., Sadikov, A., Bratko, I.: Fighting knowledge acquisition bottleneck with argument based machine learning. In: The 18th European Conference on Artificial Intelligence (ECAI), pp. 234–238 (2008)

    Google Scholar 

  8. Guid, M., Možina, M., Krivec, J., Sadikov, A., Bratko, I.: Learning positional features for annotating chess games: A case study. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 192–204. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Možina, M., Guid, M., Sadikov, A., Bratko, I.: Goal-Based Rule Learning. Technical report, Faculty of Computer and Information Science, University of Ljubljana, Slovenia (2009), http://www.ailab.si/matej/KBNK/GBRL.pdf

  10. Bratko, I.: Knowledge-based problem-solving in AL3. Machine Intelligence 10, 73–100 (1982)

    Google Scholar 

  11. Možina, M., Žabkar, J., Bratko, I.: Argument based machine learning. Artificial Intelligence 171(10/15), 922–937 (2007)

    MATH  MathSciNet  Google Scholar 

  12. Delétang, D.: Mat avec le fou et le cavalier. Las Stratgie 56(2), 25–32 (1923)

    Google Scholar 

  13. Dvoretsky, M.: Dvoretsky’s Endgame Manual, 2nd edn. Russell Enterprises, Inc. (2008)

    Google Scholar 

  14. van den Herik, H.J.: Representation of experts’ knowledge in a subdomain of chess intelligence. In: IJCAI, pp. 252–255 (1983)

    Google Scholar 

  15. Bramer, M.: Representation of knowledge for chess endgames: towards a self-improving system. PhD thesis, The Open University: Faculty of Mathematics, Milton Keynes, England (1977)

    Google Scholar 

  16. van den Herik, H.J.: Computerschaak, Schaakwereld en Kunstmatige Intelligentie. PhD thesis, Delft University of Technology, Academic Service, The Hague (1983)

    Google Scholar 

  17. van den Herik, H.J., Herschberg, I.: Omniscience, the rulegiver? In: Pernici, B., Somalvico, M. (eds.) Proceedings of L’Intelligenza Artificiale Ed Il Gioco Degli Scacchi, III Convegno Internazionale, pp. 1–17 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guid, M., Možina, M., Sadikov, A., Bratko, I. (2010). Deriving Concepts and Strategies from Chess Tablebases. In: van den Herik, H.J., Spronck, P. (eds) Advances in Computer Games. ACG 2009. Lecture Notes in Computer Science, vol 6048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12993-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12993-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12992-6

  • Online ISBN: 978-3-642-12993-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics