Skip to content

This project is an implementation of the Minimax AI Algorithm on the Tic-Tac-Toe (or Naughts and Crosses) game using the Minimax algorithm in AI.

License

Notifications You must be signed in to change notification settings

Arnav-Barman/TicTacToe-AI_Project-Minimax

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

TicTacToe-AI_Project-Minimax

This project is an implementation of the Minimax AI Algorithm on the Tic-Tac-Toe (or Naughts and Crosses) game using the Minimax algorithm in AI.

Project Report in higher quality can be found here!

This project has been made for submission in the course UCS411:Artificial Intelligence in the 4th sem of Computer Engineering at Thapar Institute of Engineering and Tehcnology, Patiala.

About

This project is an implementation of the Minimax AI Algorithm on the Tic-Tac-Toe (or Naughts and Crosses) game using the Minimax algorithm in AI.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published