Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: not using nullmove?

Author: Dann Corbit

Date: 01:24:54 02/18/04

Go up one level in this thread


On February 18, 2004 at 03:36:14, Tim Foden wrote:

>On February 17, 2004 at 20:55:13, Dann Corbit wrote:
>
>>Here's a dumb idea:
>>
>>Write a program to scan a Nalimov database, but throw away everything except
>>won/lost/drawn/broken (needs 2 bits per reflected board position to store the
>>outcome state).
>>
>>Then write a table.
>>
>>For up to the 4 man tables, it should be really tiny and fit into ram without
>>any fuss.
>>
>>Seems like one single program could write a recognizer for anything [for which a
>>Nalimov or Edwards or Thompson EGTB exists].
>
>This is almost exactly the idea that is well documented in Heinz's book!  :)
>
>He gets all the required 3+4 piece tables to fit in just over 15 MB.

I read his book, but I don't remember his suggestion of canibalization of
existing tb files to create bitbases.  I do remember the notion of extreme
compression of bitbases.



This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.