95 lines
No EOL
3.4 KiB
C++
95 lines
No EOL
3.4 KiB
C++
/*
|
|
* File: Board.cpp
|
|
* Author: amr
|
|
*
|
|
* Created on July 30, 2025, 9:20 PM
|
|
*/
|
|
|
|
#include "Board.hpp"
|
|
|
|
/*
|
|
* This is how the chessboard is organized in memory
|
|
* This handy dandy chart should help me from getting totally
|
|
* confused!
|
|
*
|
|
* FILE 0 1 2 3 4 5 6 7
|
|
* 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h'
|
|
* +-----+-----+-----+-----+-----+-----+-----+-----+
|
|
* RANK 0 | A1 | B1 | C1 | D1 | E1 | F1 | G1 | H1 | boardGrid[0][0] to boardGrid[0][7]
|
|
* RANK 1 | A2 | B2 | C2 | D2 | E2 | F2 | G2 | H2 | boardGrid[1][0] to boardGrid[1][7]
|
|
* RANK 2 | A3 | B3 | C3 | D3 | E3 | F3 | G3 | H3 | ...
|
|
* RANK 3 | A4 | B4 | C4 | D4 | E4 | F4 | G4 | H4 |
|
|
* RANK 4 | A5 | B5 | C5 | D5 | E5 | F5 | G5 | H5 |
|
|
* RANK 5 | A6 | B6 | C6 | D6 | E6 | F6 | G6 | H6 |
|
|
* RANK 6 | A7 | B7 | C7 | D7 | E7 | F7 | G7 | H7 |
|
|
* RANK 7 | A8 | B8 | C8 | D8 | E8 | F8 | G8 | H8 | boardGrid[7][0] to boardGrid[7][7]
|
|
* +-----+-----+-----+-----+-----+-----+-----+-----+
|
|
*
|
|
*/
|
|
|
|
Board::Board() {
|
|
// set up the board grid with smart pointers
|
|
// initialize each square with a Piece, set to PIECE_EMPTY
|
|
boardGrid.resize(8);
|
|
for (int i = 0; i < 8; i++) {
|
|
boardGrid[i].resize(8);
|
|
switch (i) {
|
|
case 0:
|
|
// white back rank
|
|
boardGrid[i][0] = std::make_unique<Rook>(PIECE_WHITE);
|
|
boardGrid[i][1] = std::make_unique<Knight>(PIECE_WHITE);
|
|
boardGrid[i][2] = std::make_unique<Bishop>(PIECE_WHITE);
|
|
boardGrid[i][3] = std::make_unique<Queen>(PIECE_WHITE);
|
|
boardGrid[i][4] = std::make_unique<King>(PIECE_WHITE);
|
|
boardGrid[i][5] = std::make_unique<Bishop>(PIECE_WHITE);
|
|
boardGrid[i][6] = std::make_unique<Knight>(PIECE_WHITE);
|
|
boardGrid[i][7] = std::make_unique<Rook>(PIECE_WHITE);
|
|
break;
|
|
case 1:
|
|
// white pawn rank
|
|
for (int j = 0; j <= 8; j++) {
|
|
boardGrid[i][j] = std::make_unique<Pawn>(PIECE_WHITE);
|
|
}
|
|
break;
|
|
case 2:
|
|
case 3:
|
|
case 4:
|
|
case 5:
|
|
continue;
|
|
case 6:
|
|
// black pawn rank
|
|
for (int j = 0; j <= 8; j++) {
|
|
boardGrid[i][j] = std::make_unique<Pawn>(PIECE_BLACK);
|
|
}
|
|
break;
|
|
case 7:
|
|
// black back rank
|
|
boardGrid[i][0] = std::make_unique<Rook>(PIECE_BLACK);
|
|
boardGrid[i][1] = std::make_unique<Knight>(PIECE_BLACK);
|
|
boardGrid[i][2] = std::make_unique<Bishop>(PIECE_BLACK);
|
|
boardGrid[i][3] = std::make_unique<Queen>(PIECE_BLACK);
|
|
boardGrid[i][4] = std::make_unique<King>(PIECE_BLACK);
|
|
boardGrid[i][5] = std::make_unique<Bishop>(PIECE_BLACK);
|
|
boardGrid[i][6] = std::make_unique<Knight>(PIECE_BLACK);
|
|
boardGrid[i][7] = std::make_unique<Rook>(PIECE_BLACK);
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
Board::~Board() {
|
|
}
|
|
|
|
void Board::setupInitialPosition() {
|
|
|
|
return;
|
|
}
|
|
|
|
void Board::movePiece(Square from, Square to) {
|
|
return;
|
|
}
|
|
|
|
void Board::deserializeBoard(uint64_t incomingBoard) {
|
|
return;
|
|
} |