Skip to main content

Blockage Detection in Pawn Endings

  • Conference paper
Computers and Games (CG 2004)

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

Included in the following conference series:

Abstract

In this article we introduce a blockage-detection method, which manages to detect a large set of blockage positions in pawn endgames, with practically no additional overhead. By examining different elements of the pawn structure, the method checks whether the Pawns form a blockage which prevents the King from penetrating into the opponent’s camp. It then checks several criteria to find out whether the blockage is permanent.

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. Berliner, H., Campbell, M.: Using chunking to solve chess pawn endgames. Artificial Intelligence 23(1), 97–120 (1984) ISSN 0004-3702

    Article  MATH  Google Scholar 

  2. Church, K.W.: Co-ordinate squares: A solution to many pawn endgames. In: IJCAI 1979, pp. 149–154 (1979)

    Google Scholar 

  3. De Groot, A.D.: Thought and Choice in Chess. Mouton Publishers, The Hague (1965) ISBN 90-279-7914-6

    Google Scholar 

  4. Fine, R.: Basic Chess Endings. Random House (2003) ISBN 0-812-93493-8

    Google Scholar 

  5. Haralick, R.M., Shapiro, L.G.: Computer and Robot Vision. Addison-Wesley, Cambridge (1992) ISBN 0-201-10877-1

    Google Scholar 

  6. Heinz, E.A.: Efficient interior-node recognition. ICCA Journal 21(3), 156–167 (1998)

    Google Scholar 

  7. Müller, K.: The clash of the titans: Kramnik - Fritz Bahrain. ICGA Journal 25(4), 233–238 (2002)

    Google Scholar 

  8. Newborn, M.: PEASANT: An endgame program for kings and pawns. In: Frey, P.W. (ed.) Chess Skill in Man and Machine, 2nd edn., pp. 119–130. Springer, New York (1977) ISBN 0-387-90790-4/3-540-90790-4

    Google Scholar 

  9. Rosenfeld, A., Kak, A.: Digital Picture Processing, 2nd edn. Morgan Kaufmann, San Francisco (1982) ISBN 0-125-97301-0

    Google Scholar 

  10. Slate, D.J.: Interior-node score bounds in a brute-force chess program. ICCA Journal 7(4), 184–192 (1984)

    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

Tabibi, O.D., Felner, A., Netanyahu, N.S. (2006). Blockage Detection in Pawn Endings. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_13

Download citation

  • DOI: https://doi.org/10.1007/11674399_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32488-1

  • Online ISBN: 978-3-540-32489-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics