Author: Robert Hyatt
Date: 09:12:49 10/25/01
Go up one level in this thread
On October 24, 2001 at 20:24:40, Tina Long wrote: >I copied this over from CTF, just in case it got missed here. >Tina > > >Posted by Colin Frayn (Profile) on October 24, 2001 at 10:21:56: > >In Reply to: Re: A random thought about bitboards. posted by Tina Long on >October 24, 2001 at 00:32:00: > >If you're interested, > >http://www.ast.cam.ac.uk/~cmf/chess/theory.html > >I think I covered them in there. > >Cheers, >Col One note. You have a formula that is not quite correct there... N = B^(d/2) + B^(d/2) is not quite right. It is right for even d's, but not odds. Correct is N = B ^ floor(d/2) + B ^ ceil(d/2) floor(x) means round down, ceil(x) means round up. Your theory stuff looked pretty good, although it didn't quite answer the question about how 128 bits would work with bitmaps...
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.