Author: Thomas Lagershausen
Date: 09:44:00 01/13/01
Go up one level in this thread
On January 13, 2001 at 06:08:39, Uri Blass wrote: >On January 13, 2001 at 05:20:07, Thomas Lagershausen wrote: > >>On January 13, 2001 at 04:50:16, David Rasmussen wrote: >> >>>On January 12, 2001 at 16:11:58, Dann Corbit wrote: >>> >>>>From: >>>>http://www.icdchess.com/forums/1/message.shtml?149281 >>>> >>>>It's awfully quite around here as far as remarks to this: >>>>[D]r1r1q3/1b2bpkn/p2p1np1/1p1Pp2p/PPp1P3/R1P1BN1P/R1B2PP1/QN4K1 b - - bm Nxe4; >>>> >>>>Can anyone's program solve it? >>> >>>What is the main line? >> >>Please follow the link above.Mainline with annotations by GM Seirawan. > >The question is if the solution is correct. > >Can the programs that solve the position get more than 50% against programs that >do not solve it if you start a fair match of 2 games from the position that was >posted. > > >I ask the question because I know that humans do a lot of mistake and one of >their mistake is that they tend to like sacrifices that are not correct. > >Some programs also learned from these humans and tend to play sometimes unsound >sacrifices. > >Uri Uri,please every !! GM would say this is the only move in this position.The position is totally hopeless without the sacrifice.Computers which not sacrifice here are having one fail low after another after a overnight analyse. It is the only move according to GM Seirawan.If you find one GM you will say the opposite i stop playing chess in the next moment.My ELO is about 2100,not US ELO. Thomas
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.