Author: Omid David Tabibi
Date: 05:52:52 02/27/03
Go up one level in this thread
On February 27, 2003 at 08:17:58, José Antônio Fabiano Mendes wrote: > Penrose vs Mecking, Lugano 1968 [Olympiad] > [D]8/5p1k/2r1b3/6Q1/8/7P/6PK/8 w >And here Penrose played 60. g4, Mecking answered 60...Bxg4 and Black was able >to build an unassailable fortress. Omid, can your private program see the >danger and avoid Penrose's pawn move? Regards, JAFM >Source ==> http://www.chessgames.com/perl/chessgame?gid=1096156 No. My algorithm tries to detect dynamic and static pawn blockages in conjunction with pieces, i.e. the pawn formation should be the predominant theme in the fortress. Detection of such fortresses as the example above is beyond its scope at the moment. The main problem is that the algorithm should declare a drawn blockage only when it is 100% sure about it. This conservatism hinders the detection of more complex figures. I was planning to publish the paper on king and pawn blockages already a month ago, but haven't managed to get the time to actually write the article yet. Hopefully in a month or two, it will be ready.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.