-
Notifications
You must be signed in to change notification settings - Fork 0
/
Board.h
73 lines (61 loc) · 2.38 KB
/
Board.h
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
#pragma once
#include <string>
#include <vector>
#include "Square.h"
#include "Move.h"
#include "List.h"
#include "Destinations.h"
#include "Constants.h"
#include "Tree.h"
namespace chess {
//
// col 0 1 2 3 4 5 6 7
// _ _ _ _ _ _ _ _
// row> 0 8 |_|_|_|_|_|_|_|_|
// 1 7 |_|_|_|_|_|_|_|_|
// 2 6 |_|_|_|_|_|_|_|_|
// 3 5 |_|_|_|_|_|_|_|_|
// 4 4 |_|_|_|_|_|_|_|_|
// 5 3 |_|_|_|_|_|_|_|_|
// 6 2 |_|_|_|_|_|_|_|_|
// 7 1 |_|_|_|_|_|_|_|_|
// a b c d e f g h
class Square;
class Move;
struct Tree;
class Board {
friend class Destinations;
char removePiece(Square* srcSquare);
char placePiece(Square* dstSquare, char piece);
public:
Square* square[8][8];
static const char* StartposFen;
unsigned char CASTLE_FLAGS;
const unsigned char WHITE_KING_MOVED = 0x01;
const unsigned char WHITE_KING_ROOK_MOVED = 0x02;
const unsigned char WHITE_QUEEN_ROOK_MOVED = 0x04;
const unsigned char BLACK_KING_MOVED = 0x08;
const unsigned char BLACK_KING_ROOK_MOVED = 0x10;
const unsigned char BLACK_QUEEN_ROOK_MOVED = 0x20;
List<Square>* whitePieceSquares;
List<Square>* blackPieceSquares;
const char whitePiecesStr[7] = "PNBRQK";
const char blackPiecesStr[7] = "pnbrqk";
Board();
void clear();
Color set(const char* fen);
Move* buildMove(const char* strLAN);
Move* buildMove(Square* src, Square* dst, char promotedTo);
bool executeMove(Move* move, List<Square>* myPieceSquares, List<Square>* yourPieceSquares);
bool revertMove(Move* move, List<Square>* myPieceSquares, List<Square>* yourPieceSquares);
Tree* findAvailableMoves(List<Square>* mySquares, const char* yourPiecesStr);
inline void identifyPieceColor(Move* move);
void movePiece(Square* srcSquare, Square* dstSquare, List<Square>* myPieceSquares, List<Square>* yourPieceSquares, char promotedTo = NoPiece);
void undoMovePiece(Square* srcSquare, Square* dstSquare, List<Square>* myPieceSquares, List<Square>* yourPieceSquares, char piece, char capturedPiece = NoPiece);
void castle(Move* move, List<Square>* myPieceSquares, bool bForward = true);
void setMoveScore(Move* move);
Tree* findLegalMoves(List<Square>* myPieceSquares, List<Square>* yourPieceSquares, const char* myPiecesStr, const char* yourPiecesStr, char myKing);
bool isKingInCheck(Tree* opponentMoves, char myKing);
~Board();
};
}