Minimax Algorithm in Game Theory | Tic-Tac-Toe AI – Finding optimal move
-
Updated
Mar 11, 2021 - Python
Minimax Algorithm in Game Theory | Tic-Tac-Toe AI – Finding optimal move
Tic Tac Toe / Noughts and Crosses application written in TypeScript & React
Tic-Tac-toe is a simple two-player game which is also called Noughts and Crosses.
The game of Tic Tac Toe or Noughts and Crosses built within Python 3.9 using Tkinter
Tic-tac-toe game using the Minimax algorithm
Tic-tac-toe/"noughts & crosses" written in Clojure (CLI + deps). AI powered by Monte Carlo tree search algorithm
Website with 3 interative pages, each one containing one mini-game (Switch lamp; Timer; Noughts and Crosses))
Ecole du Web - Project JS Noughts and Crosses Game
Noughts and Crosses bot for AIgaming,com (https://www.aigaming.com/GameInfo/GameTypes?type=53)
Simple tic-tac-toe game (noughts and crosses) 3х3
Noughts and Crosses is a cross-platform game implemented in Qt5 Quick/QML
This is a distributed tic-tac-toe game with an AI broker server that plays with gamers concurrently. Docker is used as the virtualization technology.
Noughts & Crosses terminal based, client-server online game with your partner through websockets.
A web-based noughts and crosses game.
This is my Noughts and Crosses (or Tic-Tac-Toe if you're American) game in Python. I just decided to upload this- sorry!
A simple Noughts and Crosses game with history, made with React.
A Pygame implementation of Noughts and Crosses with a fully-functional AI
This is a Tic-Tac-Toe Game.
Tic Tac Toe using a minimax Algorithm, the AI will never lose. Made in React
Noughts and Crosses with Giphys in React
Add a description, image, and links to the noughts-and-crosses topic page so that developers can more easily learn about it.
To associate your repository with the noughts-and-crosses topic, visit your repo's landing page and select "manage topics."