Blockage detection in pawn endings

Authors:
Omid David Tabibi;Ariel Felner;Nathan S. Netanyahu
Affiliations:
Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel;Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel;Department of Computer Science, Bar-Ilan University, Ramat-Gan, Israel
Venue:
CG'04 Proceedings of the 4th international conference on Computers and Games
Year:
2004

Citing 4
Cited 3

Using chunking to solve chess pawn endgames

Artificial Intelligence
Computer and Robot Vision

Computer and Robot Vision
Digital Picture Processing

Digital Picture Processing
Co-ordinate square: a solution to many chess pawn endgames

IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1

Genetic algorithms for mentor-assisted evaluation function optimization

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Extended Null-Move Reductions

CG '08 Proceedings of the 6th international conference on Computers and Games
Expert-driven genetic algorithms for simulating evaluation functions

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

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.