Author: Janosch Zwerensky
Date: 10:44:33 09/18/01
Hi everyone, I don't expect that currently any program can solve one of these problems given less than weeks of reflection time, but I'd like to know anyway what different progs say: [D] 8/8/8/5Bp1/7k/7P/4pPK1/8 b - - 0 1 Here, 1. ... g4 is the only way for black to win, since everything else (except for 1. ... e1N, which obviously doesn't win) leaves white with the possibility of responding with 2.Bg4! which permanently locks up black's king and thus secures the draw. Does any program find 1. ... g4! within a reasonable amount of time? [D] 8/2k5/1p4R1/1K6/P2b4/8/8/8 w - - 0 1 This one is from the Ham vs. Fritz6 correspondence match. Fritz6 failed to win this position, but Ham showed, with the help of others, that it could in fact have won, with the strongest move being 1. Ka6! (for details see Ham's analysis on white's 56th move in Fritz6 vs. Ham at http://correspondencechess.com/campbell/ham/fr_hambl.htm ). (a) Does any program want to play Ka6 at any reasonable time control? (b) Is any program capable of winning this ending against a top chess engine, when the latter gets at least a few seconds to choose its moves? [D] 6kr/8/rp1p1p1p/pPpPpPpP/P1P1P1P1/8/8/4K3 w - - 0 1 It is very easy to see (for a human) that in this position 1. bxa6 is a bad idea. How long does your program take to understand this, too? Regards, Janosch.
This page took 0.01 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.