https://github.com/aashrafh/unbeatabletictactoe

A tic-tac-toe game that never loses using the Mini-max Algorithm.
https://github.com/aashrafh/unbeatabletictactoe

ai ai-games css games html javascript minimax minimax-algorithm tic-tac-toe tictactoe tictactoe-game

Last synced: 21 days ago
JSON representation

A tic-tac-toe game that never loses using the Mini-max Algorithm.

• Host: GitHub
• URL: https://github.com/aashrafh/unbeatabletictactoe
• Owner: aashrafh
• License: mit
• Created: 2019-07-03T22:49:29.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2019-07-04T14:41:24.000Z (over 5 years ago)
• Last Synced: 2024-10-25T14:33:49.575Z (2 months ago)
• Topics: ai, ai-games, css, games, html, javascript, minimax, minimax-algorithm, tic-tac-toe, tictactoe, tictactoe-game
• Language: JavaScript
• Size: 8.79 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Unbeatable TicTacToe Game

This is a simple tic-tac-toe game that uses the mini-max algorithm as an AI player against the human player so it never loses.

## Minimax Algorithm

In real life, a human would think of all the possible consequences for each move. This is where the minimax algorithm comes handy.

The algorithm evaluates the moves that lead to a terminal state based on the players’ turn. It will choose the move with maximum score when it is the AI’s turn and choose the move with the minimum score when it is the human player’s turn. Using this strategy, Minimax avoids losing to the human player.

## Demo

[Play it on CodePen](https://codepen.io/aashrafh/full/ZdRMYV)

![Demo](https://s3.gifyu.com/images/InteractiveDictionarydfa13c2407c324a9.md.gif)

## Inspiration

This implementation of the Mini-Max Algorithm based on the following tutorial: [FreeCodeCamp](https://www.freecodecamp.org/news/how-to-make-your-tic-tac-toe-game-unbeatable-by-using-the-minimax-algorithm-9d690bad4b37/)