Author: Gian-Carlo Pascutto
Date: 02:28:35 05/25/01
Go up one level in this thread
On May 25, 2001 at 03:50:58, Rafael Andrist wrote: >I plan to implement Nullmove in my program and have some questions: >Are killers moves also used in Nullmove-subsearch? And if so, are seperate >killer lists used or is there only one killer list and the killers in the >Nullmove-search are stored/taken in/from this general list, but at the >appropriate (+1) depth? I just treat the nullmove search as if it were the normal search. Killers aren't the end of the world as far as move ordering goes, so their effect will be minimal. It could be interesting to use a seperate table for behind-nullmove nodes, but I doubt it will gain you much. >Is the hash also used during Nullmove-subsearch? I think the gain of using the >hash table will be minimal because of the reduced depth and this hash entrys >couldn't be used elsewhere. Move ordering! Researches! -- GCP
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.