Author: Frank Schneider
Date: 01:29:49 12/30/98
Hi all programmers! I know it sounds very simple and unsound, but has anyone tried this: IF - a position is found in the transpositiontable and - it is an upper bound (all moves failed low) and - the hashvalue is < alpha and - hashdepth==depth-1 (tableentry from previous iteration) THEN only search the first n moves but do not store the result in the transpositiontable. The idea is based on the observation that most nodes are either a) nodes where only very few moves are searched until one causes a cutoff or b) nodes where all moves fail low. This is where the heuristic tries to save some time. I just ran a first test with a mixed 100 positions testsuite (all searched 6 ply) and got nice results: - more correct moves (??) - >20% less nodes I'll have a closer look at this.... Have a Happy New Year, Frank
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.