Noughts and Crosses is a game that many people learn as young children. This project researches the different methods of creating a computer program that is able to play Noughts and Crosses agains a human player, with the computer winning or drawing every game. Of the algorithms researched, the Minimax Algorithm provided the best solution.
-
Notifications
You must be signed in to change notification settings - Fork 0
Delphboy/EPQ
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 | |
---|---|---|---|---|