Author: Robin Smith
Date: 09:23:58 06/16/05
Go up one level in this thread
On June 15, 2005 at 23:21:20, Joshua Lee wrote: >580: Recent EPD - Correspondence, Positional >[D] r1qr2k1/pb2bpp1/1p2pn1p/2p4P/3P1B2/2PB1N2/PP2QPP1/1K1R3R w - - 0 1 > >Analysis by Deep Shredder 9: <snip> >1.Rhg1 > = (0.10) Depth: 20/48 01:04:21 1683879kN >1.Rhg1 Nd5 > = (0.10) Depth: 20/49 01:20:02 2095148kN >1.Rhg1 Nd5 2.Be5 Qc6 3.Bb5 Qc8 4.g4 a6 5.Bd3 > = (0.20) Depth: 21/49 01:43:53 2719691kN > >(Lee, D.P.W 15.06.2005) > >As far as i know position was posted here in the past but i don't know of it >being solved. Recently i have been re running the 2000+ positions on my Laptop. >The hardest position so far was solved in 81mintes 31 seconds so now i would >like a computer 3 Times faster than my current one. Hi Joshua, I posted this position from a game of mine in the world championship semi-finals several years ago. At that time no programs found 1.Rhg1! Programs not only have to see the positional benefits of the move, but they also have to see tactically deep enough to refute the reply 1...Nxh5? with 2.Bxg6!; so from that standpoint the position is as much (or more) a tactical test than a positional one. It is impressive that Shredder finds the correct move. -Robin
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.