Author: Dann Corbit
Date: 21:40:33 08/11/03
Go up one level in this thread
On August 11, 2003 at 21:01:22, Steven Edwards wrote: >I've been writing a new chess programming toolkit as a foundation for an >upcoming chessplaying progam. The toolkit, named "CT" (how original!), is >implemented entiely in C++ without any kludgey preprocessor condtionals and has >been tested under both OpenBSD and Linux. > >One of the classes in CT is the CTEnumeration class which is used to count >distinct movepaths for a given position and depth. Objects of this class can be >made to output the counts for each immediate subtree as well as the total of al >the subtrees. > >As there are other programmers testing their move generation code, I am appendng >the (long) list of the counts for movepath enumerations of the initial position >for depths from zero to nine in the hope that it might be useful. Note that all >of these numbers have been verified by multple independent move generation >schemes. Is CT available? I would like to play with it.
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.