Author: Kim Roper Jensen
Date: 11:41:05 08/13/99
I once read an article about a programming technique called deep razoring, I think the function was the 'cut' a branch in the searchtree very early on in the search even if the program didnt get an "exact" pos value, to get deeper plies. Is there anyone who uses this and/or know if this was the idea behind the technique ?? With regards Kim Jensen PS. To Robert Hyatt, your program is GREAT, keep up the good work ( I also think its great that you release your code. )
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.