A simple Python AI program with GUI that plays 4-in-a-row (or Connect 4).
Gameplay, minmax, alpha beta pruning
simple console game Tic Tac Toe with AI
Making a Smart TicTacToe game implemented with different algorithms
Complete implementation of unbeatable TicTacToe game with Alpha-Beta Pruning. (Visual C++)
A TicTacToe game-playing agent implemented using the MiniMax Algorithm (with Alpha-Beta Pruning) in C++
Tic-Tac-Toe AI
A tic-tac-toe CLI program implemented in Python. Uses the minimax algorithm to play against the computer.
Simple minimax algorithm with alpha-beta pruning
This repo features two AI-driven projects: a Python game that employs Min-Max and Alpha-Beta pruning algorithms for strategic gameplay, and a Prolog-based expert system designed for optimizing water resource management using decision trees.
Simple board game with alpha-beta pruning AI
AI agent playing the fruit rage game. Based on Alpha Beta Pruning.
Chess Framework for different types of Chess AI's
An AI agent for a two player game which predicts the next best move based on Minimax algorithm and Alpha-Beta Pruning.
Chess player that generates optimal move against an opponent through the use of a game tree and alpha-beta pruning. The algorithm can be used against human or other computer-generated players.
AI player for Gobblet Game using MiniMax algorithm with alpha-beta pruning and custom heuristics
Play Connect Four against MiniMax and MCTS AIs
This project involves creating a Python program capable of solving Checkers endgame puzzles using advanced AI techniques such as alpha-beta pruning, node ordering, and state caching.
Add a description, image, and links to the alpha-beta-pruning topic page so that developers can more easily learn about it.
To associate your repository with the alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."