Computer Chess Club Archives


Search

Terms

Messages

Subject: TB's Basic Question

Author: Steve Coladonato

Date: 07:40:30 01/18/00

Go up one level in this thread


Are tablebases basically a set of finite positions that have pointers to
subsequent positions (most probably positions leading to a win)?  And if so, is
the basic algorithm to go to the next position that in turn will have a pointer
to a "won" position?  I am also concluding that once a program starts to use a
tablebase, it no longer does any "real" processing, just pointer evaluation.  Is
this basically it or am I way off the mark here?

Thanks.

Steve



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.