Skip to content

Tic-Tac-Toe game with unbeatable AI implemented, playing on the command line

Notifications You must be signed in to change notification settings

jomariya23156/tictactoe-unbeatable-ai

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

Unbeatable Tic-Tac-Toe AI

There are 2 versions of AI

  • using Normal Minimax algorithm
  • Using Minimax algorithm with Alpha-Beta pruning technique

Both versions are unbeatable, but alpha-beta pruning is more optimal in term of computation time.
In code, I have written to show the number of visited nodes to compare the difference between Normal Minimax and Alpha-Beta pruning

About

Tic-Tac-Toe game with unbeatable AI implemented, playing on the command line

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages