A C++ project in which you can play chess against an AI that uses alpha-beta pruning to predict the optimal move.
-
Updated
Mar 12, 2023 - C++
A C++ project in which you can play chess against an AI that uses alpha-beta pruning to predict the optimal move.
An unbeatable Tic-Tac-Toe Artificial Intelligence in C++, featuring the Minimax algorithm with Alpha-Beta pruning and visualized move tree traversal
基于qt开发的不围棋小游戏
A UCI-compatible Chess Engine written in C++20 with an Android and WearOS Interface
Game GUI and AI player for a variant of classic chess
A Tic-Tac-Toe AI
🤖 A simple and extensible Connect4 with graphical user interface where you can play against an AI.
Two Player (Adversarial) Version of Fillomino | (Depth-First) Proof Number Search, Monte Carlo Tree Search, Minimax, Negamax, Alpha-beta pruning
Created my own game and its AIs as well
A game of American checkers created for CS 5346 (Advanced Artificial Intelligence) at Texas State University in Fall 2019. Includes two-player, single-player (vs AI), and AI-vs-AI game modes. The AI uses minimax search with alpha-beta pruning and custom evaluation functions. Includes house rules to force a draw under certain conditions.
Two player checkers game for CS5346 Artificial Intelligence
C++ Tic-Tac-Toe
C++ Gomoku game
TicTacToe AI that utilizes the Minimax Algorithm and the Alpha Beta Pruning Algorithm to reduce Game-Tree searches.
Terminal TicTacToe game with AI under 100 lines of code.
[Desktop Game] The term project for OOP. Compete against our Chinese dark chess engine, which using MiniMax algorithm.
Tic Tac Toe game with the AI as opponent. The AI is implemented as a Minimax algorithm.
A game playing AI agent for Go using Minimax with Alpha Beta Pruning and Iterative deepening algorithms.
Add a description, image, and links to the minimax-alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the minimax-alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."