Author: Uri Blass
Date: 23:44:48 09/14/00
Go up one level in this thread
On September 14, 2000 at 20:23:00, Dann Corbit wrote: >On September 14, 2000 at 19:53:00, pavel wrote: >[snip] >>mahamood,p - Junior 6.0 >>r4r2/q1pb1pkp/1p1p2p1/2nPpP1P/2P1P3/p1N2P2/PP1Q4/2KR1BR1 w - - 0 1 >> >>Analysis by Junior 6.0: >> >>1.f5xg6 a3xb2+ 2.Qd2xb2 h7xg6 3.h5xg6 >> ² (0.52) Depth: 3 00:00:00 >>1.b2-b4 Nc5-b7 2.Qd2-g5 f7-f6 3.Qg5-g3 g6-g5 4.Nc3-b5 Bd7xb5 5.c4xb5 >> ± (0.75) Depth: 3 00:00:00 1kN >> ± (1.02) Depth: 9 00:00:02 236kN >>1.f5-f6+ Kg7-h8 2.Qd2-h6 a3xb2+ 3.Kc1-b1 Rf8-g8 4.h5xg6 Rg8xg6 5.Rg1xg6 Nc5-e6 >>6.d5xe6 Qa7xa2+ 7.Nc3xa2 Ra8-g8 8.Rg6xg8+ Kh8xg8 9.Qh6-g7# >> ± (1.05) Depth: 9 00:00:02 317kN >> +- (#9) Depth: 11 00:00:34 3963kN >> >>(mahamood, MyTown 15.09.2000) >> >> >> >>this is a joke right?? > >Not at all. You've only made it 11 plies, and the solution found is 18 plies >away. There might be a better one. The analysis of Junior6 is not in plies. The depth has another meaning. There is no point in telling all programs to search 16 plies because 16 plies of many programs can miss mate in 2 because of null move pruning. The only point of the experiment is if the program does not do pruning and there is no top program that does no pruning. The only interesting experiment is to give programs the same time and not the same depth. 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.