AI for the tic-tac-toe game

Used algorithms:

Note, MCTS uses backpropagation of a scalar reward with negamax^[1] whereas the alternative approach will be to backpropagate a vector delta.

References

C. B. Browne et al., "A Survey of Monte Carlo Tree Search Methods," in IEEE Transactions on Computational Intelligence and AI in Games, vol. 4, no. 1, pp. 1-43, March 2012, doi: 10.1109/TCIAIG.2012.2186810

Name		Name	Last commit message	Last commit date
Latest commit History 35 Commits
.github/workflows		.github/workflows
.gitignore		.gitignore
Board.cpp		Board.cpp
Board.hpp		Board.hpp
CMakeLists.txt		CMakeLists.txt
ElementPool.hpp		ElementPool.hpp
LICENSE		LICENSE
MCTS.cpp		MCTS.cpp
MCTS.hpp		MCTS.hpp
Minimax.cpp		Minimax.cpp
Minimax.hpp		Minimax.hpp
README.md		README.md
Solver.hpp		Solver.hpp
main.cpp		main.cpp