A game of checkers written using minmax algorithm and alpha-beta pruning.

Minmax (minimax) algorithm with Alpha-Beta (𝛼−𝛽, ab) Pruning optimization for the Checkers (Draughts) game in Python 3. Same minimax algorithm works for chess, tic tac toe or similar games.

In this project we try to create a sophisticated computer agent to play the Contact Bridge card game. Our goal is to develop an agent that is tough to play against, with fast reaction time so it is able to play in real time against humans. We approached this as a search problem, and implemented search-tree heuristics based on Minimax and Monte C…

Implementing COP-Kmeans and PC-Kmeans

Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm

The goal of this project was to make a User vs AI chess game, such that user makes whichever (legal) move they like and in turn, the AI performs the best move it can find. The game ends when either the user or the AI enters checkmate or stalemate state - or if you quit forcibly :)

Baghchal implementation in Python

Very simple checkers bot made using minimax algorithm with alpha-beta pruning to calculate the ideal move.

MinMax implementation in the game of Mastermind

An AI based board game developed with Pygame.

Connect4 AI using neural network

Implementing COP-Kmeans and PC-Kmeans

Small Board Games Engine for Tic-Tac-Toe and Connect-4 with bot players

Computational Intelligence @ Polito - Project Assignment

Gomoku with minmax bot

International (Polish) Checkers game (10x10) with minimax algorithm with alpha-beta pruning. Practicing Python.

NightFox is an AI capable of playing state based games without using neural networks and purely on primitive AI algorithms.

Small implementation of an Algorithm playing Tic tac toe.

Pacman AI that utilizes minimax, alpha beta pruning, expectimax.