This parallel implementation utilising TPL simulates the game of 'Treblecross' (a Tic-Tac-Toe variant) on a 60x1 single-line playing squared cell grid with the AI player playing against itself. The AI is realised through a variant of Minimax with Alpha-Beta Pruning algorithm.
LewisSharpe/treblecross-Minimax_with_AB
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
This parallel implementation utilising TPL simulates the game of 'Treblecross' (a Tic-Tac-Toe variant) on a 60x1 single-line playing squared cell grid with the AI player playing against itself. The AI is realised through a variant of Minimax with Alpha-Beta Pruning algorithm.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published