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.
Loading...
Searching...
No Matches
SolversIndividuals Member List

This is the complete list of members for SolversIndividuals, including all inherited members.

crossOver(const SolversIndividuals &Parent1, const SolversIndividuals &Parent2)SolversIndividuals
get_lose()SolversIndividuals
get_score()SolversIndividuals
get_win()SolversIndividuals
init_at_random()SolversIndividuals
loseSolversIndividualsprivate
mutate()SolversIndividuals
operator<SolversIndividualsfriend
operator=(const SolversIndividuals &other)SolversIndividuals
print_info()SolversIndividuals
print_info_as_matrix()SolversIndividuals
print_info_as_matrix_to_file(std::ofstream &file)SolversIndividuals
scoreSolversIndividualsprivate
set_lose(const std::vector< double > &lose_)SolversIndividuals
set_score(const double &score_)SolversIndividuals
set_win(const std::vector< double > &win_)SolversIndividuals
SolversIndividuals()SolversIndividuals
SolversIndividuals(std::vector< double > &win_, std::vector< double > &lose_)SolversIndividuals
winSolversIndividualsprivate