UCI Chess engine written in C++11
-
Updated
Sep 7, 2022 - C++
UCI Chess engine written in C++11
🎮 使用α-β剪枝(Alpha-beta-pruning)的极小极大算法(Minimax-algorithm)实现的井字棋(一字棋、tic-tac-toe)游戏。
An impossible-to-beat tictactoe ai that uses the minimax algorithm. Made using flutter.
A simple IA for Nine Mens Morris game using minimax and alphabeta pruning search algorithms and C++ (SDL).
A simple IA for Nine Mens Morris game using minimax and alphabeta pruning search algorithms and cocos2d framework
TicTacToe Game using minimax algorithm
A c++ program to play tic-tac-toe with minimax tree. Try to beat and it ;-)
🥇 Unbeatable Tic Tac Toe game with a README contains very thing about MiniMax algorithms with explanation of it with c++ and js Implementation code
An unbeatable Tic-Tac-Toe Artificial Intelligence in C++, featuring the Minimax algorithm with Alpha-Beta pruning and visualized move tree traversal
Connect Four using MiniMax Alpha-Beta Pruning
N-Tuple Neural Network for tic tac toe
Winning bot of the Strategy Card Game AI Competition CEC 2019 and COG 2019
AI bot for the 2-player board game "Game of the Amazons"
基于qt开发的不围棋小游戏
A bot to play Tic-Tac-Toe using the Minimax Strategy.
A UCI-compatible chess engine, capable of beating (most) human players.
Proiectarea Algoritmilor - UPB 2019
Connect Four with Alpha Beta Pruning (VC++ and ClanLib)
Add a description, image, and links to the minimax topic page so that developers can more easily learn about it.
To associate your repository with the minimax topic, visit your repo's landing page and select "manage topics."