Author: Erik Evenson
Date: 08:27:29 08/01/01
Go up one level in this thread
Excellent points -- especially the emphasis on generating the tablebases via a retrograde approach. I haven't built the code to generate moves in reverse, but I believe that is a minor mod to my forward move generation code, which is done using bitboards (rotated and otherwise). This should also speed the analysis since mates in 2 become mates in 1 after flagging all the mates in 1. Very interesting...now I just need to determine how to store the resulting move table efficiently... I am starting to understand why the Nalimov tables are set up the way they are. If only I didn't have a real job to take me away from this... :)
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.