Author: Landon Rabern
Date: 21:49:50 01/04/00
After move generation, when putting a killer/pv/hash table move on top of the
list I search through the list of moves until I find the move I am looking for,
shift the whole list down and put the move I wanted on top. Is there a better
way to do this? The way I am doing it seems inefficient.
To get the pv out of the search I do this
value=recurseNextLevel();
if (value>alpha){
pv[depth]=pv[depth+1];
pv[depth][depth]=moveList[current];
alpha=value;
}
At the end the pv will be in pv[0]. Now when I use this to order the search, do
I do I add a pv move everytime, like a killer, or only the first time through.
I have been adding it everytime, thinking that a pv move at a certain depth with
a certain preceeding move, will likely be good at that same depth for another
preceeding move.
Anyone throwing out checks by seeing if the king was captured on the next level,
how do you make sure you aren't in check at the leaves?
Thanks in advance,
Landon W. Rabern
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.