A strong chess engine made in c++
-
Updated
Jul 19, 2024 - C++
A strong chess engine made in c++
A tic tac toe game with an AI opponent using minimax algorithm and alpha-beta pruning
A C++ project in which you can play chess against an AI that uses alpha-beta pruning to predict the optimal move.
🎮 使用α-β剪枝(Alpha-beta-pruning)的极小极大算法(Minimax-algorithm)实现的井���棋(一字棋、tic-tac-toe)游戏。
A set of AIs for the 2048 tile-merging game. Includes an expectimax strategy that reaches 16384 with 34.6% success and an ML model trained with temporal difference learning.
An impossible-to-beat tictactoe ai that uses the minimax algorithm. Made using flutter.
A full featured chess engine designed to fit in an embedded environment, using less than 2K of RAM!
A c++ program to play tic-tac-toe with minimax tree. Try to beat and it ;-)
TicTacToe Game using minimax algorithm
Examples that use famous MiniMax, AlphaBeta, and A* (A-star) algorithms
Tic-Tac-Toe game implemented in C++ with Minimax algorithm and Alpha-Beta Pruning!
An unbeatable AI Tic Tac Toe game in C++, implementing the Minimax algorithm, optimized with Alpha-Beta pruning, and visualized tree traversal for each move.
A bot to play Tic-Tac-Toe using the Minimax Strategy.
A tic tac toe game implementation using Minimax algorithm on wxWidgets 3.0.3 API
The purpose of this project is to use the Minimax Algorithm in order to play against the computer, or you may play against another human and test your skills.
This is an implementation of the minimax algorithm in c++ that is use in a game of tictactoe
Connect Four with Alpha Beta Pruning (VC++ and ClanLib)
Tic Tac Toe using OpenGL
My first c++ program integrating the power of AI algorithms(minimax).
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."