Author: Bruce Moreland
Date: 21:20:17 07/26/01
Go up one level in this thread
On July 26, 2001 at 05:40:09, Uri Blass wrote: >On July 25, 2001 at 18:36:08, James T. Walker wrote: > >>This position arose today in a game between Hiarcs 7.32 vs Century 3.2. >>Although Hiarcs searched for 6 minutes on an Athlon 900 with 128M hash and it's >>score dropped from the previous 0.87 to -0.56 it still could not resist the BxN >>which I believe loses. I think almost any move which saves the Bishop keeps >>white alive. Best is probably Kxb4 or Be3. Crafty is very fast to avoid BxN. >>Junior7 is slow but finds it in a little over 1 minute. >> >>[D]8/p4k1p/6p1/8/1p2P1P1/1Kn3P1/3B3P/8 w > >Here is Hiarcs7.32's analysis on PIII800(64 Mbytes hash tables) > >New position >8/p4k1p/6p1/8/1p2P1P1/1Kn3P1/3B3P/8 w - - 0 1 > >Analysis by Hiarcs 7.32: > >1.Bxc3 bxc3 2.Kxc3 > ± (1.34) Depth: 1 00:00:00 >1.Bxc3 bxc3 2.Kxc3 > ± (1.34) Depth: 2/4 00:00:00 >1.Bxc3 bxc3 2.Kxc3 Kf8 3.Kd4 > +- (1.55) Depth: 3/8 00:00:00 >1.Bxc3 bxc3 2.Kxc3 h6 3.e5 Ke7 > +- (1.41) Depth: 4/10 00:00:00 >1.Bxc3 bxc3 2.Kxc3 h6 3.Kc4 Ke6 4.Kd4 > +- (1.63) Depth: 5/10 00:00:00 3kN >1.Bxc3 bxc3 2.Kxc3 h6 > +- (1.63) Depth: 6/13 00:00:00 8kN >1.Bxc3 bxc3 2.Kxc3 a5 3.g5 Ke6 4.Kd4 a4 5.Kc4 > +- (1.50) Depth: 7/14 00:00:00 24kN >1.Bxc3 bxc3 2.Kxc3 a5 3.g5 Ke6 4.Kd4 a4 5.g4 a3 6.Kc3 > ± (1.27) Depth: 8/16 00:00:00 70kN >1.Bxc3 bxc3 2.Kxc3 Ke6 3.Kd4 a5 4.g5 a4 > ± (1.11) Depth: 9/22 00:00:01 185kN >1.Bxc3 bxc3 2.Kxc3 Ke6 3.Kd4 a5 4.g5 a4 5.Kc3 Ke5 6.Kb4 a3 7.Kxa3 Kxe4 > ± (1.05) Depth: 10/23 00:00:02 450kN >1.Bxc3 bxc3 2.Kxc3 Ke6 3.Kd4 h6 4.h4 a5 5.Kc4 a4 6.Kb4 a3 7.Kxa3 > ± (0.95) Depth: 11/24 00:00:07 1115kN >1.Bxc3 bxc3 2.Kxc3 Ke6 3.Kd4 h6 4.h3 a6 5.Ke3 a5 6.Kd4 a4 > ± (0.80) Depth: 12/25 00:00:19 2915kN >1.Bxc3 bxc3 2.Kxc3 Ke6 3.Kd4 h6 4.h4 a5 5.h5 gxh5 6.gxh5 a4 7.Kc3 a3 8.Kb3 Ke5 >9.Kxa3 Kxe4 > ± (0.78) Depth: 13/28 00:00:53 8311kN >1.Bxc3 bxc3 > ² (0.53) Depth: 14/30 00:01:56 18160kN, tb=2 >1.Bxc3 bxc3 2.Kxc3 Ke6 3.Kd4 a5 4.g5 a4 5.Kd3 Ke5 6.Kc4 Kxe4 7.Kb4 Kf5 8.Kxa4 >Kg4 9.Ka5 Kxg5 > ³ (-0.58) Depth: 14/30 00:02:55 26829kN, tb=13 >1.Be3 a5 2.Bb6 Nxe4 3.Bxa5 Nf2 4.g5 Ne4 5.Bd8 > ² (0.27) Depth: 14/30 00:09:51 91947kN, tb=39 > >(Blass, Tel-aviv 26.07.2001) So Hiarcs, everyone's example of a knowledge program, has no knowledge for this and (eventually) solves it with search. It's going along at 150K nps on a pretty hot machine, in an ending, which is pretty slow, and yet everything it is doing has no bearing on the position? Does anyone know what kind of knowledge it has? bruce
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.