Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How To Probe Nalimov Tablebase

Author: Dieter Buerssner

Date: 02:28:20 10/09/04

Go up one level in this thread


On October 09, 2004 at 02:06:30, Henry Hongdoyo wrote:

>I want to know using Nalimov tablebase for chess endgame.
>i have 3-4 piece Nalimov tablebase. But i don't know
>how to use that in my chess program. My chess program
>is my final project in college. So i very... very... need
>help to finish my final project. Does anyone can help me ?
>i make my chess program in DELPHI 5 with negascout, move
>ordering, forward pruning, iterative deepening, TT, and
>other algorithm.
>Please help me

I have no idea, how to do it with Delphi. Somehow you have to "link" it together
with C/C++ code (perhaps by the help of a DLL). Heiner Marxen explained what to
do in C step by step a while ago here. See
http://chessprogramming.org/cccsearch/ccc.php?art_id=192968 and perhaps some
other posts in this threads. SOme more comments were at the Winboard forum:
http://f11.parsimony.net/forum16635/messages/20833.htm

The actual access code is written by Eugene Nalimov in C++ and by Andrew Kadatch
in C (the compression/decompression routines). It is available as part of the
Crafty tarball. You have to ask Eugene Nalimov and Andrew Kadatch for
permission. Writing the low level access in Delphi (or any other language)
yourself would be practically impossible.

Regards,
Dieter



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