ChineseCheckers
This project is a solver for two players' Chinese Checkers game using the Alpha Beta pruning algorithm. The program is written in C++ and uses a number of heuristics to improve the performance of the algorithm. Overall, the Chinese Checkers solver program has been built with performance in mind, and is designed to deliver fast and efficient game play. Whether you are playing against a bot or using the program as a library in your own project, you can be confident that the program will deliver high-performance results.
|
This class is used in order to generate the openings. More...
#include "openings_generator.hpp"
#include <unordered_map>
#include <fstream>
#include <sstream>
#include <thread>
#include <boost/python.hpp>
#include "Types.hpp"
#include "AlphaBeta.hpp"
Macros | |
#define | MAX_TREE_DEPTH 2 |
#define | DEPTH_ALPHABETA 5 |
#define | TREE_WIDTH (10UL) |
Functions | |
int | main () |
This class is used in order to generate the openings.
#define DEPTH_ALPHABETA 5 |
#define MAX_TREE_DEPTH 2 |
#define TREE_WIDTH (10UL) |
int main | ( | ) |