Author: Uri Blass
Date: 20:18:12 02/18/01
Go up one level in this thread
On February 18, 2001 at 01:22:38, Tanya Deborah wrote: > > > >Hi to all, > >This is a beautiful game by the Great Master Leonid Stein. >I am interested to know, How many programs can avoid the fatal mistake 21.Qxh1? > >Deep Fritz can avoid that!!!, Deep Fritz can see that Qxb3 is better than Qxh1. > Junior6 and Hiarcs7.32 and Fritz6 can´t avoid that... > >The position is very interesting, in this kind of position you can see some >computer weak points, (the machines sometimes have so much appetite, and can´t >see the great atack by White after move 21. > >Another question? Which program can find 12.Qb3! ???? (with a winning endgame) >- because after change Queens, White is much better. I think there are no >program that can find this move. I think that you are wrong and there are programs that can find 12.Qb3 in less than an hour on fast hardware(I guess that Junior is one of them because Junior5.9 on p200 can find 12.Qb3 in less than 4 hours with 0.00 evaluation) I am also not sure if finding Qb3 is more hard for programs than avoiding Qxh1 because programs only need to see a draw evaluation in order to find Qb3 when they need to see a winning evaluation for white in order to avoid Qxh1. 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.