Author: Stuart Cracraft
Date: 06:44:54 07/20/04
Go up one level in this thread
On July 20, 2004 at 07:51:54, Aivaras Juzvikas wrote: >On July 19, 2004 at 18:07:53, Stuart Cracraft wrote: > >>So I recently added some code to search the PV first >>but with an add-on whose effect may be a curveball >>in the longrun but appears okay at first. >> >>PV is searched first but with the add-on that any other >>position that is searched (but not on the PV) there is a check >>made for whether a PV-move at the same depth is available >>in this position and if so it is searched first. >> >>Anyway, after doing the above my test results made another (small) >>jump over just using the first move only of the prior iteration's >>principal variation. >> >>Version 2.01 >> ~Time Solved Solved Time Nodes other information >> per move % / Total Tot Tot other information >>// 5 sec - 75% 227/300 1620.68 281651520 938838/5/173787 0/0/18410820/0/0/0 >>// 1 sec - 66% 199/300 323.91 53624628 178749/1/165555 0/0/3556160/0/0/0 >> >>Version 2.00 >>// 5 sec - 73% 218/296 1687.07 301382976 1004610/6/178643 0 0/19507018/0/0/0 >>// 1 sec - 62% 187/300 313.89 52147824 173826/1/166134 0/0/3460861/0/0 >> >>Stuart > >im afraid to dissapoint you but this is already being done in TSCP. it has no >hash tables but instead uses saved pv move to search first. Why would this disappoint me? I am not a researcher who publishes so I am not interested in hoarding information or being first to publish because nothing I do depends on it (tenure, title, etc.) I have enjoyed reading TSCP (and other chess engines) and certainly don't try to be a "firster". TSCP would be advised to use hash moves however because there is benefit beyond relation to PV. Stuart
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.