defs.h

Go to the documentation of this file.

#pragma once
 
#include "stdlib.h"
#include "stdio.h"
 
#include "board/board_data.h"
 
 
// #define DEBUG
 
#define MAX_HASH 1024
 
#ifndef DEBUG
#define ASSERT(n)
#else
#define ASSERT(n) \
if(!(n)) { \
printf("%s - Failed",#n); \
printf("On %s ",__DATE__); \
printf("At %s ",__TIME__); \
printf("In File %s ",__FILE__);
printf("At Line %d\n",__LINE__); \
exit(1);}
#endif
 
typedef unsigned long long U64;
 
#define NAME "Vice 1.1"
#define BRD_SQ_NUM 120
 
#define MAXGAMEMOVES 2048
#define MAXPOSITIONMOVES 256
#define MAXDEPTH 64
 
#define START_FEN  "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1"
 
#define INF_SCORE 30000
#define ISMATE (INF_SCORE - MAXDEPTH)
 
enum { EMPTY, wP, wN, wB, wR, wQ, wK, bP, bN, bB, bR, bQ, bK  };
enum { FILE_A, FILE_B, FILE_C, FILE_D, FILE_E, FILE_F, FILE_G, FILE_H, FILE_NONE };
enum { RANK_1, RANK_2, RANK_3, RANK_4, RANK_5, RANK_6, RANK_7, RANK_8, RANK_NONE };
 
enum { WHITE, BLACK, BOTH };
enum { UCIMODE, XBOARDMODE, CONSOLEMODE };
enum {
  A1 = 21, B1, C1, D1, E1, F1, G1, H1,
  A2 = 31, B2, C2, D2, E2, F2, G2, H2,
  A3 = 41, B3, C3, D3, E3, F3, G3, H3,
  A4 = 51, B4, C4, D4, E4, F4, G4, H4,
  A5 = 61, B5, C5, D5, E5, F5, G5, H5,
  A6 = 71, B6, C6, D6, E6, F6, G6, H6,
  A7 = 81, B7, C7, D7, E7, F7, G7, H7,
  A8 = 91, B8, C8, D8, E8, F8, G8, H8, NO_SQ, OFFBOARD
};
 
enum { FALSE, TRUE };
 
enum { WKCA = 1, WQCA = 2, BKCA = 4, BQCA = 8 };
 
typedef struct {
    int move;
    int score;
} S_MOVE;
 
typedef struct {
    S_MOVE moves[MAXPOSITIONMOVES];
    int count;
} S_MOVELIST;
 
enum {  HFNONE, HFALPHA, HFBETA, HFEXACT};
 
typedef struct {
    U64 posKey;
    int move;
    int score;
    int depth;
    int flags;
} S_HASHENTRY;
 
typedef struct {
    S_HASHENTRY *pTable;
    int numEntries;
    int newWrite;
    int overWrite;
    int hit;
    int cut;
} S_HASHTABLE;
 
typedef struct {
 
    int move;
    int castlePerm;
    int enPas;
    int fiftyMove;
    U64 posKey;
 
} S_UNDO;
 
typedef struct {
 
    int pieces[BRD_SQ_NUM];
    U64 pawns[3];
 
    int KingSq[2];
 
    int side;
    int enPas;
    int fiftyMove;
 
    int ply;
    int hisPly;
 
    int castlePerm;
 
    U64 posKey;
 
    int pceNum[13];
    int bigPce[2];
    int majPce[2];
    int minPce[2];
    int material[2];
 
    S_UNDO history[MAXGAMEMOVES];
 
    // piece list
    int pList[13][10];
 
    S_HASHTABLE HashTable[1];
    int PvArray[MAXDEPTH];
 
    int searchHistory[13][BRD_SQ_NUM];
    int searchKillers[2][MAXDEPTH];
 
} S_BOARD;
 
typedef struct {
 
    int starttime;
    int stoptime;
    int depth;
    int timeset;
    int movestogo;
 
    long nodes;
 
    int quit;
    int stopped;
 
    float fh;
    float fhf;
    int nullCut;
 
    int GAME_MODE;
    int POST_THINKING;
 
} S_SEARCHINFO;
 
typedef struct {
    int UseBook;
} S_OPTIONS;
 
 
#define FROMSQ(m) ((m) & 0x7F)
#define TOSQ(m) (((m)>>7) & 0x7F)
#define CAPTURED(m) (((m)>>14) & 0xF)
#define PROMOTED(m) (((m)>>20) & 0xF)
 
#define MFLAGEP 0x40000
#define MFLAGPS 0x80000
#define MFLAGCA 0x1000000
 
#define MFLAGCAP 0x7C000
#define MFLAGPROM 0xF00000
 
#define NOMOVE 0
 
 
/* MACROS */
 
#define FR2SQ(f,r) ( (21 + (f) ) + ( (r) * 10 ) )
#define SQ64(sq120) (square120To64[(sq120)])
#define SQ120(sq64) (square64To120[(sq64)])
#define CLRBIT(bb,sq) ((bb) &= clearBitMask[(sq)])
#define SETBIT(bb,sq) ((bb) |= setBitMask[(sq)])
 
#define IsBQ(p) (isBishopQueen[(p)])
#define IsRQ(p) (isRookQueen[(p)])
#define IsKn(p) (isKnight[(p)])
#define IsKi(p) (isKing[(p)])
 
#define MIRROR64(sq) (Mirror64[(sq)])