Author: Chessfun
Date: 23:15:09 02/19/01
Go up one level in this thread
On February 20, 2001 at 00:22:57, Uri Blass wrote: >On February 19, 2001 at 23:14:04, Chessfun 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) >> >>rn2kb1r/ppn1p1pp/2p1Ppb1/3q4/3N2P1/1QP4P/PP1N1P2/R1B1KB1R b KQkq - 0 1 >> >>Analysis by Junior 6.0: On thunderbird 900 at 945 mhz with 128 mb hash. >> >>12...Qxh1 13.Qxb7 Kd8 14.N2f3 Bd3 15.Bf4 Qxf1+ 16.Kd2 Qxf2+ 17.Kxd3 Nba6 >>18.Bxc7+ Nxc7 19.Nxc6+ Ke8 20.Ncd4 Kd8 >> = (0.00) Depth: 17 00:01:31 57667kN >>12...Qxh1 13.Qxb7 Kd8 14.N2f3 Bd3 15.Bf4 Qxf1+ 16.Kd2 Qxf2+ 17.Kxd3 Nba6 >>18.Bxc7+ Nxc7 19.Nxc6+ Ke8 20.Ncd4 Kd8 >> = (0.00) Depth: 18 00:05:22 199587kN >>12...Qxh1 13.Qxb7 Kd8 14.N2f3 Bd3 15.Bf4 Qxf1+ 16.Kd2 Qxf2+ 17.Kxd3 Nba6 >>18.Bxc7+ Nxc7 19.Nxc6+ Ke8 20.Ncd4 Kd8 >> = (0.00) Depth: 19 00:13:21 496604kN >>12...Qxh1 13.Qxb7 Kd8 14.N2f3 Bd3 15.Bf4 Qxf1+ 16.Kd2 Qxf2+ 17.Kxd3 Nba6 >>18.Bxc7+ Nxc7 19.Nxc6+ Ke8 20.Ncd4 Kd8 >> = (0.00) Depth: 20 00:29:23 1084318kN >>12...Qxh1 13.Qxb7 Kd8 14.N2f3 Bd3 15.Bf4 Qxf1+ 16.Kd2 Qxf2+ 17.Kxd3 Nba6 >>18.Bxc7+ Nxc7 19.Nxc6+ Ke8 20.Ncd4 Kd8 >> = (0.00) Depth: 21 01:03:15 2383009kN >>12...Qxh1 13.Qxb7 >> ² (0.30) Depth: 22 03:04:50 2901138kN >> >>Sarah. > >I said that I guess that it can find 12.Qb3 in less than an hour and not that it >can avoid 12...Qxh1 in less than an hour. I apologize, you are totally correct. >The 0.30 number is typical for Junior. > >When Junior fails low the evaluation is often changed by 0.30 before going to >the next iteration. I was scared of going to the next as it may have been a couple of hours. Sarah.
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.