Author: Inmann Werner
Date: 15:26:27 11/30/99
Since some time, I do the following. when I am in the loop in alpha-beta, trying all moves of a position and find a new bestmove I do not stuff it in the hashtable (what others normally do?). I look at all moves till all searched or a cutoff occurs. Then I stuff only the cutoff or best move in the hash. Difference is, that i only stuff in hash one time and i do not have a "best move so far" in the hashtable. In my prog it works some better then the "normal" method. Has anyone tried this also? Did I miss something in my idea? (don´t think so, cause it works well..) Werner
This page took 0.01 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.