Note: [1] Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel, Email: davoudo@cs.biu.ac.il. http://www.cs.biu.ac.il/~davoudo
Note: [2] Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel, Email: felner@cs.biu.ac.il. http://www.cs.biu.ac.il/~felner
Note: [3] Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel, Email: nathan@cs.biu.ac.il, and Center for Automation Research, University of Maryland, College Park, MD 20742, USA, Email: nathan@cfar.umd.edu.
Note: [4] This article is a slightly adapted version of the authors’ article in the CG’04 conference proceedings. It is republished with permission of the Editors of the Proceedings and of the publisher, Springer-Verlag, Heidelberg, Germany.
Abstract: In this article4 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.
DOI: 10.3233/ICG-2004-27304
Journal: ICGA Journal, vol. 27, no. 3, pp. 150-158, 2004
