Author: Miguel A. Ballicora
Date: 18:16:51 03/12/02
Go up one level in this thread
On March 12, 2002 at 19:04:07, Albert Silver wrote: >On March 12, 2002 at 18:37:13, Miguel A. Ballicora wrote: > >>On March 12, 2002 at 17:54:28, Uri Blass wrote: >> >>>On March 12, 2002 at 16:38:46, José Antônio Fabiano Mendes wrote: >>> >>>> Kasparov-Portisch,Niksic 1983 >>>> [D]2r2rk1/p1q1bpp1/1p6/n2R4/8/P4N2/1B2QPPP/5RK1 w >>>>And here Kasparov played the surprising 21.Bxg7 and won the game in great style. >>>>Can chess programs find this move? JAFM >>>>Source ==> http://www.geocities.com/TimesSquare/Hangar/5176/replays/gm0012.htm >>> >>>Programs can find a better move after a long search(Rh5) >>> >> >>Deep Blue proved convincingly that Rh5 wins after a very deep search. >>That's how the thread started. > >What was the evidence against Kasparov's move? Was it what Otello posted? Kasparov's move is good, maintains and advantage but it is not a clear win. From memory, I think that 26... Qc2 (rather than Qc5) gave a lot of chances for a fight. Rh5 wins. However, the demosntration was very deep. > > Albert > >> >>Regards, >>Miguel >> >> >>>This position was discussed in the past >>> >>>See for example >>>http://www.it.ro/ccc_search/ccc.php?art_id=171130 >>> >>>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.