Author: Pham Hong Nguyen
Date: 21:24:54 01/22/04
Go up one level in this thread
On January 22, 2004 at 17:58:22, KarinsDad wrote: >Did programs actually go through every single legal move to create these? Yes, you are right. It visits them all not only one time but repeatedly in many iterations. The main algorithm is called retrograde. Now I think you have enough key words to search all topics you want in r.g.c.c. There are so many good discusions / lessons about tablebase there - I have learned and developed my own databases (for Chinese chess) just by finding and reading them. IMO, that group may be one of the best sources for learning when Heinz's papers may be so hard for beginers. +Pham
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.