Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 357 Bytes

File metadata and controls

2 lines (2 loc) · 357 Bytes

EPQ Abstract

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.