Author: Enrique Irazoqui
Date: 03:10:55 02/19/01
Go up one level in this thread
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. Stein,L - Birbrager,I rn2kb1r/ppn1p1pp/2p1Ppb1/3q4/3N2P1/2P4P/PP1N1P2/R1BQKB1R w KQkq - 0 1 Analysis by DEEP FRITZ : 12.Nxc6-- µ (-0.84) Depth: 1/3 00:00:00 12.Nxc6-- Qxh1 -+ (-3.16) Depth: 1/10 00:00:00 12.Bg2! -+ (-3.09) Depth: 1/10 00:00:00 12.Bg2! Qxg2 -+ (-2.47) Depth: 1/10 00:00:00 12.Rg1! -+ (-1.94) Depth: 1/10 00:00:00 12.Rg1! Nxe6 = (0.00) Depth: 1/10 00:00:00 12.Qf3! = (0.00) Depth: 1/10 00:00:00 12.Qf3! Qxf3 ± (0.72) Depth: 1/10 00:00:00 12.Qf3 Qxf3 13.N2xf3 ± (0.72) Depth: 2/6 00:00:00 12.Qf3 Qxf3 13.N2xf3 Be4 ² (0.63) Depth: 3/9 00:00:00 1kN 12.Qf3 Qxf3 13.N2xf3 c5 14.Bf4 cxd4 ² (0.53) Depth: 4/14 00:00:00 3kN 12.Qf3 Qe5+ 13.Qe2 Qxe2+ 14.Bxe2 c5 15.Bb5+ Nxb5 ² (0.31) Depth: 5/17 00:00:00 14kN 12.Qf3-- = (0.00) Depth: 6/14 00:00:00 21kN 12.Qf3-- Qe5+ 13.Qe2 Qxe2+ 14.Bxe2 c5 15.Nf5 Nxe6 16.Bb5+ Nd7 = (0.00) Depth: 6/15 00:00:00 25kN 12.Qf3 Qe5+ 13.Qe2 Qxe2+ 14.Bxe2 c5 15.Nf5 Nxe6 16.Bd3 = (-0.09) Depth: 7/18 00:00:00 69kN 12.Qf3! = (0.22) Depth: 8/22 00:00:00 165kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bf4 Bxf3 15.Nxf3 Nxe6 16.Be3 h5 17.Bg2 = (0.19) Depth: 9/25 00:00:00 532kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bf4 Bxf3 15.Rg1 c5 16.Nxf3 Nxe6 17.Bb5+ Nd7 ² (0.38) Depth: 10/29 00:00:01 1501kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bf4 Bxf3 15.Nxf3 Nxe6 16.Be3 h5 17.Bg2 g5 = (0.19) Depth: 11/26 00:00:02 2547kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bf4 Bxf3 15.Rg1 Nba6 16.Nxf3 Nxe6 17.Be3 g5 = (0.25) Depth: 12/28 00:00:05 5778kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bf4 Bxf3 15.Rg1 Nd5 16.Bxb8 Bxg4 17.Bg3 Bh5 = (0.16) Depth: 13/29 00:00:10 12494kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bf4 Bxf3 15.Rg1 Nd5 16.Bxb8 Bxg4 17.Bg3 Bh5 = (0.25) Depth: 14/36 00:00:34 40992kN 12.Qf3 Qxf3 13.N2xf3 c5 14.Bf4 cxd4 15.Bxc7 Be4 16.Bb5+ Nc6 17.Ke2 Rc8 = (0.13) Depth: 15/37 00:01:24 103899kN 12.Qf3 Qxf3 13.N2xf3 Be4 14.Bc4 c5 15.Nb5 Nca6 16.Ke2 Nc6 17.Bf4 g5 = (0.25) Depth: 16/39 00:04:13 312867kN 12.Qf3 Qxf3 13.N2xf3 c5 14.Bf4 cxd4 15.Bxc7 Be4 16.Bb5+ Nc6 17.Ke2 Rc8 = (0.13) Depth: 17/42 00:09:06 682066kN 12.Qf3 Qxf3 13.N2xf3 c5 14.Bf4 cxd4 15.Bxc7 Be4 16.Bb5+ Nc6 17.Ke2 Rc8 = (0.13) Depth: 18/42 00:20:26 1547420kN 12.Qb3! = (0.16) Depth: 18/51 00:49:26 3771628kN 12.Qb3! Qxb3 13.axb3 h5 14.f4 hxg4 15.f5 Bxf5 16.Nxf5 g6 17.Nd4 Bh6 ± (0.97) Depth: 18/51 03:42:55 16423504kN 12.Qb3 Qxb3 13.axb3 h5 14.f4 hxg4 15.f5 Bxf5 16.Nxf5 Nxe6 17.Ng3 g5 ± (0.91) Depth: 19/50 04:25:39 19651501kN 12.Qb3 Qxb3 13.axb3 h5 14.Bg2 Bd3 15.Nc4 g5 16.Be3 hxg4 17.hxg4 Rxh1+ ± (0.91) Depth: 20/54 08:03:18 36345516kN (Irazoqui, Cadaqués 19.02.2001) >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.