Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Compiling Error Crafty SE

Author: Bryan Hofmann

Date: 08:06:01 07/18/04

Go up one level in this thread


On July 18, 2004 at 09:32:59, Nolan Denson wrote:

>Thanks for the help ... I called my new file mchess.h and included it in the
>option.c file
>
>After fixing that i didn't get the error you got. I get
>
>
>..\dgt.c(3):  catastrophic error: could not open source file "unistd.h"

In the crafty.c file comment out or delete the line that has

#include dgt.c




>
>
>I guess this is going to be a step by step process.  If I get a good build
>without getting your info i will send you my code if needed.
>
>On July 18, 2004 at 08:50:14, Bryan Hofmann wrote:
>
>>On July 18, 2004 at 08:39:18, Nolan Denson wrote:
>>
>>>If i just removed this line from the code since it is already int ... will this
>>>be ok.
>>
>>You need to remove all of the following from the chess.h file and place it in a
>>new .h file. All of this is at the end of the chess.h file.
>>
>>
>>/*/random number generator defines*/
>>extern __forceinline  randomMT(void) ;
>>//extern __forceinline unsigned long randomMT();
>>typedef unsigned long uint32;
>>
>>#define N              (624)                 // length of state vector
>>#define M              (397)                 // a period parameter
>>#define K              (0x9908B0DFU)         // a magic constant
>>#define hiBit(u)       ((u) & 0x80000000U)   // mask all but highest   bit of u
>>#define loBit(u)       ((u) & 0x00000001U)   // mask all but lowest    bit of u
>>#define loBits(u)      ((u) & 0x7FFFFFFFU)   // mask     the highest   bit of u
>>#define mixBits(u, v)  (hiBit(u)|loBits(v))  // move hi bit of u to hi bit of v
>>
>>static uint32   state[N+1];     // state vector + 1 extra to not violate ANSI C
>>static uint32   *next;          // next random value is computed from here
>>static int      leftrnd = -1;      // can *next++ this many times before
>>reloading
>>/*  end*/
>>
>>
>>extern __forceinline int Iterate(int wtm, int search_type, int root_list_done);
>>
>>extern __forceinline int Evaluate(TREE * RESTRICT tree, int ply, int wtm, int
>>alpha, int beta);
>>
>>extern __forceinline int Search(TREE * RESTRICT tree, int alpha, int beta, int
>>wtm, int depth,
>>    int ply, int do_null, int lp_recapture);
>>
>>extern __forceinline  int SearchSMP(TREE * RESTRICT tree, int alpha, int beta,
>>int value, int wtm,
>>     int depth, int ply, int mate_threat, int lp_recapture);
>>
>>extern __forceinline void MakeMove(TREE * RESTRICT tree, int ply, int move, int
>>wtm);



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.