Connect Four with Alpha Beta Pruning (VC++ and ClanLib)
-
Updated
Feb 25, 2013 - C++
Connect Four with Alpha Beta Pruning (VC++ and ClanLib)
Gameplay, minmax, alpha beta pruning
An AI bot for the game of Tak
simple console game Tic Tac Toe with AI
Making a Smart TicTacToe game implemented with different algorithms
A UCI Engine Developed from the ground up by Blake Johnson
A TicTacToe game-playing agent implemented using the MiniMax Algorithm (with Alpha-Beta Pruning) in C++
Intelligent Agent to play Connect-4 with a modifiable depth aided with a decision tree visualizer to trace the agent's decision making process
Connect 4 game in Java using MinMax with alpha-beta pruning algorithm and Swing.
Tic-Tac-Toe AI
This repository contains all the lab assignments done in the CSE422 course of BracU.
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
Efficient Algortihm for Tic Tac Toe game ai with alpha beta pruning
Reversi game written in c#
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.
Repository for Artificial Intelligence course assignment, labs and practice.
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."