Author: Nathan Thom
Date: 16:41:33 01/22/03
Hi all, I implemented a pretty quick killer move algorithm into LittleThought last night from memory of what its supposed to do. A couple of questions: 1. First, i incremented the killers[from][to] array by the inverse of the current depth (ie MAX_DEPTH - depth) when a cutoff occurred. In my code depth 0 is the root and it increases downwards. I figured this would be better than plain depth because cutoffs closer to the root node would be better. However i found this to slow it down considerably. To test my theory, i changed it to plain depth and it perfored much better than normal. So, can someone explain why incrementing by depth was better than MAX_DEPTH - depth or this just some quirk with my implementation/test positions? Also if someone has any ideas as to a better incremental? 2. What is a history move? why is it different from a killer move? Thanks.
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.