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
132
133
134
135
136
137
138
139
140
141
142
143
144
|
#include "board.hpp"
#include "bot.hpp"
#include <cassert>
#include <cstdio>
#include <iostream>
#include <print>
#include <string>
std::string toChar(PieceType type, bool white) {
switch (type) {
case NONE:
return " ";
case KING:
return white ? "♚" : "♔";
case QUEEN:
return white ? "♛" : "♕";
case ROOK:
return white ? "♜" : "♖";
case BISHOP:
return white ? "♝" : "♗";
case KNIGHT:
return white ? "♞" : "♘";
case PAWN:
return white ? "♟" : "♙";
default:
assert(false && "Unknown piece");
return " ";
}
}
Piece createPiece(PieceType type, bool color, bool moved) {
Piece piece;
piece.type = type;
piece.color = color;
piece.moved = moved;
return piece;
}
void printBoard(Board *b) {
std::string line = " +------------------------+\n";
std::string whiteLetters = " a b c d e f g h \n";
std::string blackLetters = " h g f e d c b a \n";
// const char *lightSquare = "\033[48;5;145m";
// // const char *darkSquare = "\033[48;5;28m";
// const char *lightSquare = "\033[48;5;240m"; // Dark gray
// const char *darkSquare = "\033[48;5;22m"; // Forest green
const char *lightSquare = "\033[48;5;245m"; // Medium gray
const char *darkSquare = "\033[48;5;29m"; // Rich green
const char *reset = "\033[0m";
std::cout << (b->turn ? whiteLetters : blackLetters);
std::cout << line;
if (b->turn) {
for (int rank = 0; rank < 8; rank++) {
std::printf("%d |", 8 - rank);
for (int file = 0; file < 8; file++) {
Piece piece = b->pieces[rank * 8 + file];
std::string symbol = toChar(piece.type, piece.color);
const char *bg = ((rank + file) % 2 == 0) ? lightSquare : darkSquare;
std::cout << bg << " " << symbol << " " << reset;
}
std::printf("| %d\n", 8 - rank);
}
} else {
for (int rank = 7; rank >= 0; rank--) {
std::printf("%d |", 8 - rank);
for (int file = 7; file >= 0; file--) {
Piece piece = b->pieces[rank * 8 + file];
std::string symbol = toChar(piece.type, piece.color);
const char *bg = ((rank + file) % 2 == 0) ? lightSquare : darkSquare;
std::cout << bg << " " << symbol << " " << reset;
}
std::printf(" | %d\n", 8 - rank);
}
}
std::cout << line;
std::cout << (b->turn ? whiteLetters : blackLetters);
std::println();
std::println("Turn: {}", b->turn ? "White" : "Black");
assert(b->castle != "");
std::println("Castling: {}", b->castle);
std::println("Can enpassant: {}", b->canEnpassant ? "Yes" : "No");
std::println("Where enpassant: {}{}", (char)((int)b->enPassant.file + 'A'),
8 - (int)b->enPassant.rank);
std::printf("Move clock: %d\n", b->MoveClock);
std::printf("Half move clock: %d\n", b->halfMoveClock);
std::printf("Board Eval: %f\n", EvaluateBoard(b));
}
void PlayMove(Move move, Board *b) {
// TODO: add all fide behavior
Piece piece = b->pieces[PositionToIndex(move.From)];
Piece piece2 = b->pieces[PositionToIndex(move.To)];
if (piece2.type != NONE) {
if (piece2.color == b->turn) {
assert(false && "capturing friendly piece error");
}
}
piece.moved = true;
if (piece.type == PAWN || piece2.type != NONE) {
b->halfMoveClock = 0;
} else {
b->halfMoveClock++;
}
if (piece.type == PAWN && b->canEnpassant && move.To == b->enPassant) {
Position capturedPawn = move.To;
capturedPawn.rank += piece.color ? 1 : -1;
b->pieces[PositionToIndex(capturedPawn)] = {false, NONE, false};
}
b->canEnpassant = false;
b->MoveClock++;
if (piece.type == PAWN) {
Position to = move.To;
to.rank -= (piece.color ? -2 : 2);
if (to == move.From) {
b->canEnpassant = true;
Position target = move.From;
target.rank += piece.color ? -1 : 1;
b->enPassant = target;
};
}
if (b->halfMoveClock >= 50) {
b->state = DRAW;
}
b->pieces[PositionToIndex(move.To)] = piece;
b->pieces[PositionToIndex(move.From)] = {false, NONE, false};
};
int PositionToIndex(Position i) { return i.rank * 8 + i.file; }
|
