Author: Dieter Buerssner
Date: 11:19:14 04/07/03
Go up one level in this thread
On April 06, 2003 at 16:59:04, Russell Reagan wrote: >Ah, an intermediate table. Is where the huge memory requirement comes from when >generating larger tablebases? No. The table trick is mainly useful for KK positions. Because any chess positions has 2 Ks, this is useful. Other tables could be used for the same sort of pieces (say the 2 Bs in KBBK). The size of KBBK would be (without additional tricks) 462*62*61/2. The "/2" comes from the fact, that the 2 Bs are indistiguishable. A table can be convenient to get a number from 0 to 62*61/2 for any 2 B squares. But it can also be done without table. The large memory requirement comes from the fact, that typically the generator wants to have all positions of a table inside memory. A table like KRPKRN would use about 1806*62*61*60*48 positions - a huge number ... Regards, Dieter
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.