Skip to content

asr21/Tic-Tac-Toe-Minimax

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

This project is to create an AI which can play Tic Tac Toe and cannot be defeated at all.

The project uses the minimax algorithm for the AI. One can learn more about the minimax algorithm from these links.

  1. http://neverstopbuilding.com/minimax
  2. http://www.geeksforgeeks.org/minimax-algorithm-in-game-theory-set-3-tic-tac-toe-ai-finding-optimal-move/

This project uses Vanilla Javascript for implementing the algorithm.

Other features of this project include playing two player game and a one player game with easy difficulty.(AI just does some random moves)

About

Minimax Algorithm implementation for Tic-Tac-Toe

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published