Author: Bas Hamstra
Date: 06:37:37 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 In my opinion it helps a lot if you try to keep perfect PV's. In case of a hashhit that should update the PV, I immediately try to reconstruct as much as possible of the PV from the hashtable and store it in a table. Works for me, 99% of the time the evaluation of the PV-endnode gives the same score as the search score and I hardly see "half" PV's. Bas.
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.