Author: José Carlos
Date: 02:34:25 08/24/01
Go up one level in this thread
On August 24, 2001 at 04:31:27, Tony Werten wrote: >Hi all. > >I like to know if there are some solutions for this problem. > >My program searches for 4 minutes, gets to 14 ply (or whatever), makes a move, >takes a pondermove and starts pondering. > >Now the first 12 ply are taken from the hashtable (<1 sec ) but it starts an >(almost) uninformed 13 ply search from which it is never going to return in the >allocated time, so it's just taking the best move it had from the previous >search, which is costing me plydepth. (and games ) > >Any ideas, sugestions ? > >cheers, > >Tony This happens to me as well, but I don't think the 13 ply search is uninformed. I think the information in the hash table is exactly the same the program would have had if it was to start the 15 ply (before actually making the move) and the program makes (in search) the two first moves of the PV, which is good information. However, I notice this 13 ply search takes very long, but I guess it's a normal behaviour. But, as I always say, it's probably that I'm wrong :) José C.
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.