Author: Uri Blass
Date: 03:22:44 02/19/01
Go up one level in this thread
On February 19, 2001 at 06:10:55, Enrique Irazoqui wrote: >On February 18, 2001 at 23:18:12, Uri Blass wrote: > >>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 didn't try Junior yet, but on a dual P933 with 512 MB hash, Deep Fritz plays >12.Qb3 after 49 minutes. A beta I have of another "Deep" program takes 92 >minutes to pick 12.Qb3. I guess that this program has also a positive evaluation for Qf3. It is clear that programs with positive evaluation for Qf3 needs more time because seeing that Qb3 leads to a draw is not enough for them. 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.