Author: Daniel Mehrmannn
Date: 01:18:58 08/27/05
Go up one level in this thread
On August 27, 2005 at 04:04:40, Daniel Shawul wrote: >On August 27, 2005 at 01:42:32, rasjid chan wrote: [...] >>4) retrieving the PV. >> This was discussed over at the winboard forum but I am still not too clear. >> We have :- >> a) the pv[ply][ply] method. But hash probe returns on exact usually make >> the PV short. Is this superflous when there is hashing? > You can have longer pvs if you don't use hash tables at PV nodes, if you >dont use null move at pv nodes, if you don't use other prunings at pv nodes. >But are you ready to pay its cost? [...] For a better search daniel's Shawul hints are fine here, but this has nothing to do for having longer PV's. May you set a flag if you're have a hash hit and if you're finished your search or each new interation you can extract your pv from your hash easily. This is allso good vs overwriting hash entries. Best, Daniel
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.