8x8 Board

From Chessprogramming wiki
Revision as of 01:34, 6 March 2021 by Phhnguyen (talk | contribs) (Programming)
Jump to: navigation, search

Home * Board Representation * Mailbox * 8x8 Board

8x8 Board [1]

The 8x8 Board as basic square-centric board representation is either a two-dimensional array of bytes (or integers), containing piece and empty square codes, indexed by file and rank index, or more commonly a one-dimensional array indexed by a square in a 0..63 range which combines rank or file indices in three consecutive bits each [2] . Such a board representation is often used redundantly in bitboard programs to answer the question which piece (if any) resides on a square efficiently. It has to deal with square mapping accordantly.

Programming

Board Board Representation

TSCP

TSCP uses two 64 element arrays, containing empty square plus pure piece code, and empty square plus piece color code [3]:.

int color[64];  /* LIGHT, DARK, or EMPTY */
int piece[64];  /* PAWN, KNIGHT, BISHOP, ROOK, QUEEN, KING, or EMPTY */

However, when generating moves, TSCP converts the board data into a bigger array 10x12 Board.

FirstChess

FirstChess uses two 64 integer arrays, for all tasks, including move generating.

int piece[64] = {
    ROOK,  KNIGHT,BISHOP,QUEEN, KING,  BISHOP,KNIGHT,ROOK,
    PAWN,  PAWN,  PAWN,  PAWN,  PAWN,  PAWN,  PAWN,  PAWN,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    PAWN,  PAWN,  PAWN,  PAWN,  PAWN,  PAWN,  PAWN,  PAWN,
    ROOK,  KNIGHT,BISHOP,QUEEN, KING,  BISHOP,KNIGHT,ROOK
};

int color[64] = {
    BLACK, BLACK, BLACK, BLACK, BLACK, BLACK, BLACK, BLACK,
    BLACK, BLACK, BLACK, BLACK, BLACK, BLACK, BLACK, BLACK,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY, EMPTY,
    WHITE, WHITE, WHITE, WHITE, WHITE, WHITE, WHITE, WHITE,
    WHITE, WHITE, WHITE, WHITE, WHITE, WHITE, WHITE, WHITE
};

Banksia

Banksia uses only one vector from C++ standard library [4]:

std::vector<Piece> pieces;

The vector is initialized [5]:

Piece empty(PieceType::empty, Side::none);
for(int i = 0; i < 64; i++) {
    pieces.push_back(empty);
}

Move Generators

Straightforward

Based on the given cell and the size of the board, programs can calculate if the target cells are out of the board. In below code Banksia generates moves for a Rook at position pos:

case PieceType::rook: // both queen and rook here
{
    int col = getColumn(pos);
    for (int y=pos - 1; y >= pos - col; y--) { /* go left */
        gen_addMove(moves, pos, y, captureOnly);
        if (!isEmpty(y)) {
            break;
        }
    }
                
    for (int y=pos + 1; y < pos - col + 8; y++) { /* go right */
        gen_addMove(moves, pos, y, captureOnly);
        if (!isEmpty(y)) {
            break;
        }
    }
                
    for (int y=pos - 8; y >= 0; y -= 8) { /* go up */
        gen_addMove(moves, pos, y, captureOnly);
        if (!isEmpty(y)) {
            break;
        }
    }
                
    for (int y=pos + 8; y < 64; y += 8) { /* go down */
        gen_addMove(moves, pos, y, captureOnly);
        if (!isEmpty(y)) {
           break;
        }
                    
    }
    break;
}

Precalculate data

Some programs pre-calculate data for each cell and extract it when generating moves. That method is well-known mentioned by GNU Chess version 4.0 document (not code).

Alternatives

As a lone board representation, the 8x8 board has some efficiency issues with move generation related to off the board test. Therefore more common are approaches dealing with that, that is 10x12 board with surrounding ranks and files, and Vector Attacks with its cheap test and unique square difference property with respect to distance and direction [6]. In Games Playing with Computers, 1972 [7] , Alex Bell introduced an array of 65 squares, where the purpose of square 65 (always empty) is to detect pawns capturing outside the board by a table driven move generator.


See also

Square Mapping Considerations
0x88

Publications

Forum Posts

External Links

Cast [8]: Jean Arp, Paul Bowles, Ceal Bryson, Alexander Calder, Jean Cocteau, Willem de Vogel, Dorothea Tanning
Max Ernst, Richard Huelsenbeck, Frederick Kiesler, Julien Lary, Julien Levy, Jaqueline Matisse, Eugene Pellegrini, Man Ray, Yves Tanguy

References

Up one Level