Ultimate Tic-Tac-Toe game coded in C++, with a MiniMax algorithm computer opponent that is currently able to defeat (not always though*) the Medium difficulty of the AI on this website.
In the game folder there is also a game 3x3.h file, that I used to first try the MiniMax algorithm on the simpler standard version of Tic-Tac-Toe.
See here.
Version 1.1:
- The new algorithm managed to defeat the Hard difficulty of Xing's
AIonce, and draw twice - Out of
6consecutive games played as X against the Medium difficulty of Xing'sAIit scored3W/1D/2L - With only
6as search depth but an improved evaluation sistem, the average move takes around3 secondsto compute, but it appears to be much stronger than earlier
Version 1.0:
- Out of
10consecutive games played as X against the Medium difficulty of Xing'sAIit scored4W/2D/4L - With
7as search depth, the average move takes around1.5 secondsto compute, however the algorithm has sometimes peaks of more than20 secondsfor a move, usually around the middle of the game, when a few small boards get completed
- improve the evaluation algorithm, as for now it is quite basic
- speed up the MiniMax algorithm, it needs to perform deeper searches to be better, as it already evaluates the position quite well
- create a standalone cpp file to calculate the next move of a given position independently from the GUI (allowing future versions of the algorithm to play some given positions against older versions to see the improvement of the algorithm)
- allow the player to choose whether to play as X or O
- add time limit to moves, picking the best found at that point
- improve the evaluation algorithm even more, if possible
No particular bug was encountered so far. Report one by contacting me in any way.
CLOC Stats
| Language | files | blank | comment | code |
|---|---|---|---|---|
| C/C++ Header | 13 | 888 | 365 | 1398 |
| C++ | 2 | 39 | 32 | 37 |
| TOTAL | 15 | 927 | 397 | 1435 |