Computer Chess Club Archives




Subject: EGTB generation with 1 bit per position?

Author: martin fierz

Date: 14:30:52 03/25/03

i computed some checkers endgame databases with retrograde analysis based on the
paper by the chinook team. for larger databases, i have a memory size problem;
specially as win32 only allows a process to use 2GB.
i once heard that it was possible to compute a win/loss/draw endgame database
using only 1 bit per position as opposed to 2 bits as i was using up to now (and
like in the chinook paper).

does someone here know more about this? i'm looking either for an explanation
for dummies, or for a reference to a paper.

thanks in advance

This page took 0.07 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.