Skip to content

Latest commit

 

History

History
13 lines (7 loc) · 441 Bytes

README.md

File metadata and controls

13 lines (7 loc) · 441 Bytes

Ultimate Tic Tac Toe

The purpose of this project is to create an optimal algorithm that solves the problem of beating an Ultimate-Tic-Tac-Toe Bot. It is a solution to our Algorithm Design Project's course.

Useful links:

The AI Games Rules