MCTS-Minimax-Selections MATE IN N CHESS PUZZLE SOLVER

For more details on our implementation see our project page - https://ysaibhargav.github.io/parallel-mcts-minimax-hybrids/

COMPILING
make clean && make cpu

To use with Xeon Phi, do
make clean && make

RUNNING
Sample puzzles are in the puzzles directory
./chess -f [PATH_TO_FEN_FILE] -d [DEPTH] -n [NUM_THREADS] -x [NON_INTERACTIVE (BOOL)] -m [PARALLEL_SCHEME] -H [MINIMAX_TRIGGER_HEURISTIC] -N [MAX_MCTS_ITERS] -r [NUM_RUNS]

The experiments from our report can be replicated by
./chess -f puzzles/4.txt -d 3 -n 1 -x 1 -m ROOT_PARALLEL -H NONZERO_WINS -N 1000000
./chess -f puzzles/6.txt -d 4 -n 1 -x 1 -m ROOT_PARALLEL -H NONZERO_WINS -N 1000000
./chess -f puzzles/4.txt -d 3 -n 1 -x 1 -m TREE_PARALLEL -H MULTIPLE_VISITS -N 4000000
./chess -f puzzles/6.txt -d 4 -n 1 -x 1 -m TREE_PARALLEL -H MULTIPLE_VISITS -N 4000000