Author: Robin Smith
Date: 11:02:28 03/16/00
Go up one level in this thread
On March 15, 2000 at 15:08:36, blass uri wrote: >On March 15, 2000 at 14:17:59, Robin Smith wrote: > ><snippped> >>In the 13th US correspondence chess championship finals I played a move that my >>computer NEVER finds. Do any programs find 17.... Qd5! >> >>This move prevents white from playing Be4 (which would put presure on b7 and >>support a possible d pawn push), it frees d8 for blacks rook and it keeps the >>queen eyeing d5, restraining whites isolated d-pawn. I believe it is the >>strongest move in the position, but when I reviewed the game with my computer it >>never finds it even after a very long "think" because of the exchange sac >>involved. > >Did you try to generate a tree with the computer to prove that 17...Qd5 is >really the best move? I don't know how to "prove" that a positional move is best. I do know that it seems programs reject it out of hand because of a faulty "refutation" ... the game continuation. > >It is clear that after 19.Nb6 white is losing but the question is if white has >no good alternative before(for example 18.f3) 18.f3 is maybe better than what white played, but white's exposed king, weak d-pawn and blacks 2 bishops are very strong strong advantages. Either 18.f3 Rd8 or 18.f3 Qg5 should give black a winning position. > >I believe that computers can avoid the blunder of taking material at long time >control but they may reject 17...Qd5 because of lines that white does not play >19.Nb6 at long time control. > >Uri 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.