Author: Dann Corbit
Date: 16:06:26 01/14/05
Go up one level in this thread
On January 14, 2005 at 18:46:52, Dieter Buerssner wrote: >On January 14, 2005 at 13:03:20, Dan Wulff wrote: > >>I'm trying to figure out the total number of TB's there will be with kxxkxx (3 >>vs 3 pieces) once they are all created. I have come to 120, but I am not sure I >>did the math correctly. > >120 is correct. If you are really interested, have a look at these two posts of >Guido Antonelli (author of tbe GAFS library - an alternative to Nalimov TBs): > >http://chessprogramming.org/cccsearch/ccc.php?art_id=223640 >http://chessprogramming.org/cccsearch/ccc.php?art_id=221160 > >I also had some private conversation with Guido, where we discussed some easier >formulas to calculate the number of different TBs. Perhaps I can still find it. >I wanted to write an article about it here in CCC, but did not find the time. I >believe, I guessed more or less the formulas, and Guido could prove it. > >>Can someone provide me with the correct number, and possibly a list of the >>classes ?? > >What do you mean by classes? I am guessing he means the functions that the C++ templates resolve to. Probably, he is going to use a C interface.
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.