A game of checkers written using minmax algorithm and alpha-beta pruning.
Implementing COP-Kmeans and PC-Kmeans
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…
Baghchal implementation in Python
Checkers project with an integrated AI and GUI ♟️
Tic-Tac-Toe Game with an unbeatable AI using Minimax Algorithm
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.
An AI based board game developed with Pygame.
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 :)
Very simple checkers bot made using minimax algorithm with alpha-beta pruning to calculate the ideal move.
International (Polish) Checkers game (10x10) with minimax algorithm with alpha-beta pruning. Practicing Python.
Pacman AI that utilizes minimax, alpha beta pruning, expectimax.
Implementation of a Tic Tac Toe emulator, and an AI with levels to play against.
Small implementation of 4 connect for a intra competition in ESILV AI class.
Final project for the course Computational Intelligence of Politecnico of Turin (2022/23)
slow and pretty bad Chess AI which I coded for my Maturaarbeit
Natural Language processing program that can identify hand written letters .
Add a description, image, and links to the minmax topic page so that developers can more easily learn about it.
To associate your repository with the minmax topic, visit your repo's landing page and select "manage topics."