Predicting the best possible move for a player in Tic Tac Toe based on MiniMax algorithm
-
Updated
May 20, 2018 - C++
Predicting the best possible move for a player in Tic Tac Toe based on MiniMax algorithm
Tic Tac Toe game built using a TCP socket connection and the Minimax algorithm on a Linux system.
A rudimentary chess game application with a command-line interface. Written in C++.
EnigmaChess - Efficient chess engine written in C++
Implementing a steepest-ascent/-descent hill-climbing algorithm and A* algorithm to solve the 8-puzzle problem.
Tic Tac Toe game implemented in C++14 and QT5
A tictactoe game using minimax algprithm
An implementation of the minimax algorithm
Реализация minimax алгоритма для игры в реверси
Thunderous Soldier is a paranoid minimax based Battlesnake making use of alpha-beta pruning and flood fill algorithms to make predictions about the future state of the game.
Four In a Row (Connect 4) game using OOP
My first C++ project: For practice, I built a Tic Tac Toe game vs. a computer opponent. The opponents' decisions are calculated using a minimax-algorithm: by checking all possible moves and outcomes, the computer opponent behaves in an optimal way and is guaranteed to never lose.
🤖 A tictactoe bot written in C++ with CUI interface.
Tic Tac Toe Game in C++ Using MiniMax Algorithm
Player vs computer Tic Tac Toe game, written with C++ on ESP32
Chess AI bot using the minimax algorithm, building upon gym-chess. Used Stockfish for the Evaluation Function
Othello(Reversi) game design
Add a description, image, and links to the minimax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the minimax-algorithm topic, visit your repo's landing page and select "manage topics."