Blockage Detection in Pawn Endings

  • Omid David Tabibi
  • Ariel Felner
  • Nathan S. Netanyahu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3846)


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.


Search Tree Hash Table Blockage Detection Blockage Position Pawn Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berliner, H., Campbell, M.: Using chunking to solve chess pawn endgames. Artificial Intelligence 23(1), 97–120 (1984) ISSN 0004-3702zbMATHCrossRefGoogle Scholar
  2. 2.
    Church, K.W.: Co-ordinate squares: A solution to many pawn endgames. In: IJCAI 1979, pp. 149–154 (1979)Google Scholar
  3. 3.
    De Groot, A.D.: Thought and Choice in Chess. Mouton Publishers, The Hague (1965) ISBN 90-279-7914-6Google Scholar
  4. 4.
    Fine, R.: Basic Chess Endings. Random House (2003) ISBN 0-812-93493-8Google Scholar
  5. 5.
    Haralick, R.M., Shapiro, L.G.: Computer and Robot Vision. Addison-Wesley, Cambridge (1992) ISBN 0-201-10877-1Google Scholar
  6. 6.
    Heinz, E.A.: Efficient interior-node recognition. ICCA Journal 21(3), 156–167 (1998)Google Scholar
  7. 7.
    Müller, K.: The clash of the titans: Kramnik - Fritz Bahrain. ICGA Journal 25(4), 233–238 (2002)Google Scholar
  8. 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-4Google Scholar
  9. 9.
    Rosenfeld, A., Kak, A.: Digital Picture Processing, 2nd edn. Morgan Kaufmann, San Francisco (1982) ISBN 0-125-97301-0Google Scholar
  10. 10.
    Slate, D.J.: Interior-node score bounds in a brute-force chess program. ICCA Journal 7(4), 184–192 (1984)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Omid David Tabibi
    • 1
  • Ariel Felner
    • 1
  • Nathan S. Netanyahu
    • 1
    • 2
  1. 1.Department of Computer ScienceBar-Ilan UniversityRamat-GanIsrael
  2. 2.Center for Automation ResearchUniversity of MarylandCollege ParkUSA

Personalised recommendations