-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathboard.c
131 lines (124 loc) · 6.55 KB
/
board.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
/***************************************************************************************
* Copyright (c) 2014, Antonio Garro. *
* All rights reserved *
* *
* Redistribution and use in source and binary forms, with or without modification, are *
* permitted provided that the following conditions are met: *
* *
* 1. Redistributions of source code must retain the above copyright notice, this list *
* of conditions and the following disclaimer. *
* *
* 2. Redistributions in binary form must reproduce the above copyright notice, this *
* list of conditions and the following disclaimer in the documentation and/or other *
* materials provided with the distribution. *
* *
* 3. Neither the name of the copyright holder nor the names of its contributors may be *
* used to endorse or promote products derived from this software without specific *
* prior written permission. *
* *
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" *
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE *
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE *
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE *
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL *
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR *
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER *
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR *
* TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF *
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
***************************************************************************************/
#include <stdio.h>
#include "board.h"
#include "random.h"
void InitBoard(BOARD *board)
{
unsigned long long init[4]={0x12345ULL,0x23456ULL,0x34567ULL,0x45678ULL};
unsigned long long length = 4;
init_by_array64(init, length);
board->zobrist_key = 0;
for (SQUARE sq = 0; sq < BOARDSIZE; sq++) {
board->squares[sq] = EMPTY;
/*Note j = 1; we want zobrist keys for EMPTY to be 0:*/
for (int j = 1; j <= 0xF; j++) {
zobkeys.zob_pieces[j][sq] = genrand64_int64();
}
zobkeys.zob_enpass[sq] = genrand64_int64();
}
for (int i = 0; i < 4; i++) zobkeys.zob_castle[i] = genrand64_int64();
zobkeys.zob_side = genrand64_int64();
board->wk_castle = 0;
board->bk_castle = 0;
board->wq_castle = 0;
board->bq_castle = 0;
board->en_passant = INVALID_SQ; /*there's no en passant pawn initialy.*/
board->pawn_material[0] = 0, board->pawn_material[1] = 0;
board->piece_material[0] = 0, board->piece_material[1] = 0;
board->bishops[0] = 0, board->bishops[1] = 0;
}
void InitZobrist(BOARD *board)
{
board->zobrist_key = 0;
for (int i = 0; i < BOARDSIZE; i++) {
if (IN_BOARD(i)) board->zobrist_key ^= zobkeys.zob_pieces[board->squares[i]][i];
}
if (board->wk_castle) board->zobrist_key ^= zobkeys.zob_castle[0];
if (board->wq_castle) board->zobrist_key ^= zobkeys.zob_castle[1];
if (board->bk_castle) board->zobrist_key ^= zobkeys.zob_castle[2];
if (board->bq_castle) board->zobrist_key ^= zobkeys.zob_castle[3];
if (IN_BOARD(board->en_passant)) board->zobrist_key ^= zobkeys.zob_enpass[board->en_passant];
if (board->white_to_move) board->zobrist_key ^= zobkeys.zob_side;
}
void InitMaterial(BOARD *board)
{
board->pawn_material[0] = 0, board->pawn_material[1] = 0;
board->piece_material[0] = 0, board->piece_material[1] = 0;
board->pawns[0] = 0, board->pawns[1] = 0;
board->bishops[0] = 0, board->bishops[1] = 0;
for (int sq = 0; sq < BOARDSIZE; sq++) {
PIECE p = board->squares[sq];
if (IN_BOARD(sq) && p != EMPTY && p != W_KING && p != B_KING) {
if (p == W_PAWN || p == B_PAWN) {
board->pawn_material[GET_COLOR(p)] += Value(p);
board->pawns[GET_COLOR(p)] = BitboardSet(sq, board->pawns[GET_COLOR(p)]);
} else {
if (p == W_BISHOP || p == B_BISHOP) board->bishops[GET_COLOR(p)]++;
board->piece_material[GET_COLOR(p)] += Value(p);
}
}
}
}
void PrintBoard(const BOARD *board)
{
printf("\n");
printf("\n+--+--+--+--+--+--+--+--+ %c %c%c%c%c +--+--+--+--+--+--+--+--+ +--+--+--+--+--+--+--+--+\n",
(board->white_to_move+1?'W':'B'),
(board->wq_castle?'Q':' '), (board->wk_castle?'K':' '),
(board->bq_castle?'q':' '), (board->bk_castle?'k':' '));
for (int i = 0x70; i >= 0; i++) {
if (!(i&0x88)) {
printf("| %c", PieceToChar(board->squares[i]));
} else {
printf("| ");
for (int j = 0; j<8; j++) printf(" %c ", (board->pawns[0] & (1ull << (ROW(i-1) >> 1) << j)) ? 'p' : ' ');
printf(" ");
for (int j = 0; j<8; j++) printf(" %c ", (board->pawns[1] & (1ull << (ROW(i-1) >> 1) << j)) ? 'P' : ' ');
printf("\n+--+--+--+--+--+--+--+--+ +--+--+--+--+--+--+--+--+ +--+--+--+--+--+--+--+--+\n");
i -= 0x19;
}
}
printf("Ply: %i (%i) EnPassant: %x\n", board->ply, board->rev_plies[board->ply], board->en_passant);
printf("Material: W: %i %i; B: %i %i; Zobrist: %Lu; Stage: %f PawnStage: %f\n",
board->piece_material[1], board->pawn_material[1],
board->piece_material[0], board->pawn_material[0],
board->zobrist_key, GameStage(board), PawnStage(board));
printf("BB: %llx , %llx; Passers: %llx ranks %i; %llx ranks %i ",
board->pawns[0], board->pawns[1],
WPassedPawns(board->pawns[1], board->pawns[0]),
DotProduct(WPassedPawns(board->pawns[1], board->pawns[0]), WRANKS),
BPassedPawns(board->pawns[0], board->pawns[1]),
DotProduct(BPassedPawns(board->pawns[0], board->pawns[1]), BRANKS));
printf("Doubled: %i %i; Eval: %i\n",
BitCount(DoubledPawns(board->pawns[1])),
BitCount(DoubledPawns(board->pawns[0])),
StaticEval(board));
}