Author: Dieter Buerssner
Date: 08:50:29 04/20/04
Go up one level in this thread
On April 20, 2004 at 06:10:05, Omid David Tabibi wrote: >In his article "PEASANT: An endgame program for kings and pawns", Newborn >writes: "Position 70 would require a 30-ply search (25,000 hours)" I did the experiment. A search without transposition tables, without pruning/extensions and with material only eval (I forgot, if I used qsearch or not). A pawn capture was found at depth 26 (after 8 hours, IIRC). With hash, it is almost guaranteed, that you find it at lower depth. Every second ply, you will have to search all moves, and many inferior moves will be refuted by seeing the pawn capture earlier. These refutations will be in the HT, and will be grabbed in the other more decent lines, to find the solution at lower depth. For my engine, even 1000 entries in the HT is enough, to solve the problem in practically no time. Regards, Dieter
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.