Author: blass uri
Date: 04:41:32 07/12/00
Go up one level in this thread
On July 12, 2000 at 07:01:58, Jason Williamson wrote: >On July 11, 2000 at 17:32:26, blass uri wrote: > >>On July 11, 2000 at 16:43:10, Yar wrote: >> >>>[D] 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 > >Bh3 is pretty, but it doesn't win. Look at Kb7. Then its pretty obvious to me >that black will get to the Kside first and pick off the F pawn for the H pawn, >and the resulting kBpkp should be easily drawn. Black cannot pick the f pawn. 5.Bh3+ Kb7 6.Nxc7 Kxc7 7.Kc3 and if 7...Kd6 8.Kd4 Uri
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.