unit_test.cpp

#include "common.h"

#include <string>
#include <cstdlib>
#include <cstdint>
#include "parser.hpp"
#include "searchalgorithm.hpp"
using std::string;

namespace unit_test {
    void block_unit_test(const Board& board)
    {
        // b1
        Block b1 {BlockColor::RED, BlockDirection::HORIZONTAL, 2, 0, 0};
        b1.unit_test();
        for(int i = 0; i < 36; i++)
            if(b1.isBelongsToThisBlock(i)) {
                cout << "the board index i: " << i
                    << " is beloned to this block" << endl;
            }
        cout << b1 << endl;

        // b2
        Block b2 {BlockColor::BROWN, BlockDirection::VERTICAL, 3, 14, 1};
        b2.unit_test();
        for(int i = 0; i < 36; i++)
            if(b2.isBelongsToThisBlock(i)) {
                cout << "the board index i: " << i
                    << " is beloned to this block" << endl;
            }
        cout << b2 << endl;

        for(int i = 0; i < 36; ++i) {
            cout << "blk idx of board index: " << i
                << " " << board.getBlockIndex(i) << endl;
        }
        cout << "--------------------" << endl;
        for(int i = 0; i < board.getNumberOfBlocks(); ++i)
        {
            int twoIndices[2] {-1, -1};
            board.getBlock(i).moveDistance(board.getBoard(), twoIndices);
        }
    }

    // main function in unit_test
    int main() {
        Parser parser(string("input/e314"));
        Board board(parser.getBoardFromFile());

        cout << "Initial Board:" << endl;
        cout << board;

        // unit_test::block_unit_test(board);

        SearchAlgorithm* algo = new BFSWithVistedStatesCheck(board, cout);
        Board::setAlgorithm("BFS - Checking Visited states");
        cout << Board::algorithm << endl;
        algo->solveProblem();

        SearchAlgorithm* algo2 = new AStar(board, cout);
        Board::setAlgorithm("AStar - Checking Visited states");
        cout << Board::algorithm << endl;
        algo2->solveProblem();
        return 0;
    }
}