Author: GuyHaworth
Date: 16:13:54 04/30/03
Go up one level in this thread
I forgot to say that you must have done some significant programming to implement both: a) the 'forward-pass' Edwards/Nalimov full-EGT repeated-trawl, and b) the 'retro' Thompson/Wirth/Wu-Beal EGT generation. The only 'trick' in the WU-Beal code is that it only needs a bitvector-based approach for DTM as 'mate in N' is only backed up on the Nth cycle. g
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.