Skip to content

Tic-tac-toe / noughts and crosses / Xs and Os game with user(X) playing against the AI(O). The AI uses Minimax algorithm to find the optimal position to play.

Notifications You must be signed in to change notification settings

raahul42/XO-with-miniMax

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 

Repository files navigation

XO with MiniMax Algorithm

Tic-tac-toe / noughts and crosses / Xs and Os game with user(X) playing against the AI(O). The AI uses Minimax algorithm to find the optimal position to play.

The algorithm was implemented using recursion

About

Tic-tac-toe / noughts and crosses / Xs and Os game with user(X) playing against the AI(O). The AI uses Minimax algorithm to find the optimal position to play.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages