Author: Dieter Buerssner
Date: 03:47:17 01/31/05
Go up one level in this thread
On January 30, 2005 at 02:51:33, Marc Bourzutschky wrote: Thanks for the nice and interesting article. >However, >I got lazy and used the same basic scheme as Ken Thompson in his pioneering >work. This is rather memory hungry, but even using 1 bit of RAM for every >position in the state space requires less than 2G for KNNNNKQ, and so can be >done even within the 2G virtual memory restriction on Windows XP. I calculate 462*62*61*60*59*58/(4!*8) = ~1.9e9 bytes for one bit vector (without the non blocking check trick of Eugene). Is one bit vector enough? Did you use the Wu Beal method? Did Thompson already use bit vectors? (It is not totally clear from the above, whether you fully followed Thompson, or perhaps just used his indexing). Regards, Dieter
This page took 0.02 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.