Author: Sune Larsson
Date: 12:21:23 03/01/01
Go up one level in this thread
On March 01, 2001 at 15:01:31, Andreas St. wrote: >On March 01, 2001 at 13:38:03, Sune Larsson wrote: > >> >> [D]8/6p1/P1b1pp2/2p1p3/1k4P1/3PP3/1PK5/5B2 w - - 0 3 >> >> Queckenstadt (Kvekkenstedt?) 1922 >> >> The two Bishops were fighting their own battle, while their Kings >> were watching. It was all about proving suited for the elevation >> to Archbishop. The struggle was tense when suddenly one of the Bishops >> realized that he could achive his goal by actually giving himself up. >> As a true religious man he did so. Transfered himself to g2 (1.Bg2!) >> and faced his rival. Left with no choice his shocked brother in faith >> entered the same square (1.-Bxg2) and found himself in a deserted land. >> After 2.e4! the door was closed. Desperately the Bishop tried to open >> it again, but could he do it in time? >> >> >> Test: If your program could search deep enough to find the win for white. >> If not - try it with 1.Bg2 played. >> >> Sune > > >Hello, > >very hard position. >Chessmaster 6555 (128 MB hash) finds 1.Bg2! in 15:14 min. on Athlon 1.2 GHZ. > >Score 0.00 ; 1. ...Bxg2 2.e4 f5 3.gxf5 exf5 4.a7 Good, but when does CM recognize that white is winning? > >Some say CM is often bad in endgame play. But my results are, CM often is very >excellent, although with out any tablebases. > >Any other Prog finds it? > >Greets > >AS
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.