Skip to content

This is a simple Javascript implementation of the game Tic Tac Toe using the minimax algorithm for the computer player. The human player at best will tie the game.

Notifications You must be signed in to change notification settings

rawat-niha/tic-tac-toe-minimax

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

tic-tac-toe-minimax

This is a simple Javascript implementation of the game Tic Tac Toe using the minimax algorithm for the computer player. The human player will at best tie the game. The application also keeps track of how much time did it take the minimax algorithm to search for the best move with the current state of the board and then it displays the results to the user. The game can be played at http://diegocasmo.me/projects/tic-tac-toe-minimax/. As a note a side, I also made a version of this game using the Alpha Beta Pruning algorithm which will serve as a comparison for efficiency between the minimax and Alpha Beta Pruning. Here is the URL for Tic Tac Toe using Aplha Beta Pruning http://diegocasmo.me/projects/tic-tac-toe-alpha/

About

This is a simple Javascript implementation of the game Tic Tac Toe using the minimax algorithm for the computer player. The human player at best will tie the game.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • JavaScript 75.0%
  • HTML 25.0%