Database

The compressed archive contains sqlite databases of positions and evaluations (positive is winning for the player next to move, 0 is draw, and a greater magnitude of evaluation indicates that the optimal line is shorter than a line with a smaller evaluation - the game ends sooner). The columns are:

1. HISTORY - columns played in order to reach the current position
2. P2MV - next player to play their turn (either 0 or 1, for player 0 or player 1)
3. MOVES - number of moves that has been played.
4. P0 - Bitboard position of player 0
5. P1 - Bitboard position of player 1
6. EVAL - Evaluation of the position.

Notes:

• Complete_positions/ contains all the possible legal positions where at minimum 1 piece is played and at maximum 4 pieces are played.
• Random_positions/ new contain legal positions, with MIN_MAX.sqlite3 determines the minimum and maximum number of pieces played.
• Random_positions_old/ contains positions, but is not as uniformly distributed compared to the newer version.
• test_positions/ contains positions from the testing set
• training/ contains positions from the training set (aggregated from all files in Complete_positions/ and Random_positions/)