testminimax.cpp

#include <iostream>
#include "common.hpp"
#include "player.hpp"
#include "board.hpp"

// Use this file to test your minimax implementation (2-ply depth, with a
// heuristic of the difference in number of pieces).
int main(int argc, char *argv[])
{
    // Create board with example state. You do not necessarily need to use
    // this, but it's provided for convenience.
    char boardData[64] = 
    {
        ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
        ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
        ' ', 'b', ' ', ' ', ' ', ' ', ' ', ' ',
        'b', 'w', 'b', 'b', 'b', 'b', ' ', ' ',
        ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
        ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
        ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
        ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' '
    };
    Board *board = new Board();
    board->setBoard(boardData);

    // Initialize player as the white player, and set testing_minimax flag and
    // the board.
    Player *player = new Player(WHITE);
    player->testingMinimax = true;
    player->setBoard(boardData);

    // Get player's move and check if it's right.
    Move *move = player->doMove(nullptr, 0);

    if (move != nullptr && move->x == 1 && move->y == 1)
    {
        std::cout << "Correct move: (1, 1)" << std::endl;
    }
    else
    {
        std::cout << "Wrong move: got ";
        
        if (move == nullptr)
        {
            std::cout << "PASS";
        }
        else
        {
            std::cout << "(" << move->x << ", " << move->y << ")";
        }
        
        std::cout << ", expected (1, 1)" << std::endl;
    }
    
    // Clean up memory.
    
    delete board;
    delete player;
    
    if (move != nullptr)
    {
        delete move;
    }

    return 0;
}