An unbeatable Tic-Tac-Toe Artificial Intelligence in C++, featuring the Minimax algorithm with Alpha-Beta pruning and visualized move tree traversal
-
Updated
Oct 5, 2024 - C++
An unbeatable Tic-Tac-Toe Artificial Intelligence in C++, featuring the Minimax algorithm with Alpha-Beta pruning and visualized move tree traversal
Sapphire Chess is a Chess engine, entirely written from scratch. It has complete game rules, an algebraic input systen, and a functional AI. It provides three game modes: Human vs. Human, Human vs. AI, and AI vs. AI. It also comes with an optional UI.
Tic Tac Toe using minimax algorithm and alphabeta prunning.
Tic-tac-toe with minimax and alpha beta pruning
Chess Engine Developed With The MiniMax Algorithm
WIP Chess Engine
The game CONNECT-4 with AI (minimax + alpha-beta pruning).
Implementation of a digital Othello game using Python's Pygame library - Artificial Intelligence (AI) project /// by theMHD; thanks for chatGPT :)
Implementation of the classic Tic Tac Toe game in C. The game allows players to play against each other or against an AI opponent.
The Caro AI game use minimax algorithm
Neural Network Chess Engine in Python
Connect4 v4.0, This project is a game developed in four versions, C, C++, Java SE & Node.js, older to newer respect
Chess game with an AI engine developed using the PyGame module
Connect Four [Artificial Intelligence Project]
An engine simulating the board game Quoridor
Six Men's Morris Minimax Algorithm with Alpha-Beta Pruning
A Checker Game implementing minimax algorithm with alpha-beta pruning to automate strategic thinking of the AI opponent.
minimax, minimax with alpha-beta prunning, semi-parallel minimax
Created my own game and its AIs as well
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."