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)游戏。
A c++ program to play tic-tac-toe with minimax tree. Try to beat and it ;-)
Connect Four using MiniMax Alpha-Beta Pruning
AI bot for the 2-player board game "Game of the Amazons"
A simple IA for Nine Mens Morris game using minimax and alphabeta pruning search algorithms and cocos2d framework
A bot to play Tic-Tac-Toe using the Minimax Strategy.
A (hopefully) intelliegent AI that plays Chinese Checkers better than most humans.
Winning bot of the Strategy Card Game AI Competition CEC 2019 and COG 2019
An impossible-to-beat tictactoe ai that uses the minimax algorithm. Made using flutter.
TicTacToe Game using minimax algorithm
Proiectarea Algoritmilor - UPB 2019
N-Tuple Neural Network for tic tac toe
Projects from CS682 Artificial Intelligence. Minimax, Naive-Bayes classifier, Kalman Filter, and Reinforcement learning
Tic Tac Toe using OpenGL
Chess opponent engine AI, using bitsets for memory optimization, written in C++
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.
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."