Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Problem with Nalimov Tablebases

Author: Heiner Marxen

Date: 14:53:57 05/01/02

Go up one level in this thread


On May 01, 2002 at 16:00:56, Todd Segal wrote:

> I have posted the code below, taking out some cout's and function sig's. I am
>sure everything is kosher up to the probe call...
>
>I am using g++ under a dual Pentium III 1.1Ghz Intel based PC running Solaris 8
>x86 (an instructional machine at my university).
>
>Thanks again for any help!

Just some minor remarks...

>  IInitializeTb(HOMEDIR);
>  int PieceDesc[10];
>  //PieceDesc will be used to describe number of pieces etc.
>  Fill Piece Desc correctly <-- I have checked this!
>
>  int TB = IDescFindFromCounters(PieceDesc);

   if (!TB) return no_data_available;

>  int side;
>  int invert;
>  square *white_loc, *black_loc;
>  int enPassant = XX;
>
>  if (TB > 0)
>    {
>      side = turn;
>      invert = false;
>      white_loc = b->white_squares;     //b is the board
>      black_loc = b->black_squares;
>    }
>  else
>    {
>      side = (turn == WHITE) ? BLACK : WHITE;
>      invert = true;
>      white_loc = b->black_squares;
>      black_loc = b->white_squares;
>      TB = -TB;
>    }
>  INDEX index = PfnIndCalc(TB, side) (white_loc, black_loc, XX, invert);
>  int results = L_TbtProbeTable(TB, 0, index);
                                     ^
Don't you want to pass "side", here -^ ?  I do so.
Also, those black_squares[] and white_squares[] are already filled properly?

Cheers,
Heiner



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.