A text-based TicTacToe game that uses minimax algorithm with alpha-beta pruning to ensure the outcome is always either a win or a tie for the computer.
-
Updated
Apr 10, 2018 - Python
A text-based TicTacToe game that uses minimax algorithm with alpha-beta pruning to ensure the outcome is always either a win or a tie for the computer.
Pacman and Ghost Agent | Python | Artificial Intelligence | Search-based Algorithms | Learning-based Algorithms
A command-line game with an invincible computer player using the Negamax algorithm with alpha-beta pruning. Clean code.
Introduction to Artificial Intelligence - Assignment
An AI bot that can play the game of Extreme Tic Tac Toe, a harder version of the classic game of Tic Tac Toe
Gomoku game and AI implementation using the alpha-beta prunning algorithm.
Playing Reversi with Python, using MinMax with Alpha-Beta
simple bot for playing coganh
Repository to demonstrate the use of Alpha-Beta Pruning to win against other intelligent agents in the adversarial game of Little-Go (5 x 5 board).
small library including min-max and alpha-beta pruning algorithms.
This repository contains my solutions for the projects of Artificial Intelligence course at Iran University of Science and Technology (IUST).
Implementation of TicTacToe game in C++ with Automation
Chess bot for playing against other players with the use of decision tree. Along with algorithms such as Minimax and Alpha-Beta pruning to reduce search paths.
Assignments completed for Artificial Intelligence Course
This is a project I did as a homework for a course at my bachelor's degree in university.
Alpha Beta algorithm implementation for ConnectFour game.
An AI for Minichess (6x5 board) using Minimax with alpha-beta pruning, custom evaluation functions, and a user interface for interactive gameplay. Version-controlled for collaboration.
To associate your repository with the alpha-beta-pruning topic, visit your repo's landing page and select "manage topics."