Blockage detection in pawn endings

Omid David Tabibi, Ariel Felner, Nathan S. Netanyahu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

In this article we introduce a blockage-detection method, which manages to detect a large set of blockage positions in pawn end-games, 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.

Original languageEnglish
Title of host publicationComputers and Games - 4th International Conference, CG 2004, Revised Papers
Pages187-201
Number of pages15
DOIs
StatePublished - 23 Jun 2006
Externally publishedYes
Event4th International Conference on Computers and Games, CG 2004 - Ramat-Gan, Israel
Duration: 5 Jul 20047 Jul 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3846 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Computers and Games, CG 2004
Country/TerritoryIsrael
CityRamat-Gan
Period5/07/047/07/04

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Blockage detection in pawn endings'. Together they form a unique fingerprint.

Cite this