Author: Will Singleton
Date: 22:48:00 07/11/00
Go up one level in this thread
On July 11, 2000 at 22:49:25, William Bryant wrote: >On July 11, 2000 at 17:32:26, blass uri wrote: > >>On July 11, 2000 at 16:43:10, Yar wrote: >> >>>8/k4p2/1r3P2/7p/1N1B1Q1P/5B2/1K5q/8 w >>> >>>Computers can't solve this >> >>I think that you are wrong. >>Computers have no problem to see that Bg2 wins(they may need more than few >>seconds but it does not say that the position is hard for computers. >> >>I guess that old programs with no tablebases and no knowledge about the blind >>bishop in endgames can fail but it does not prove that computers cannot solve >>it. >> >>1.Bg2 Qxf4 2.Bxb6 Kb8 3.Bc7+ Qxc7 4.Na6+ Kc8 5.Bh3+ is winning for white. >> >>Uri > >Even programs without tablebases and specific knowledge about blind bishops can >find this one given some time. > >Screamer b52 (the version currently on the website) > >11/04 7245985 124.496 +4.92 Bg2 Qxf4 Bxb6+ Kb8 Bc7+ Qxc7 Na6+ Kc8 > >Just a little over 2 minutes on a g3 266mhz with netscape and other web activit >going on a the same time. > >William >wbryant@ix.netcom.com > >Screamer home page >http://pweb.netcom.com/~wbryant/screamer.html That's pretty amazing, nice work. I ran several programs on this position, including Hiarcs. None were able to find it at all, let alone in 2 minutes. How could it find this in only 11 ply, without the wrong-color bishop knowledge? Will
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.