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…

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

Chess Engine Implementation using Minmax, Alpha-Beta Pruning, and Quiescence Search Algorithm.

A doudizhu(chinese poker) final phase cracker. (欢乐)斗地主残局分析器

🧠 chess ai utilizing minmax w/ alpha-beta pruning

Baghchal implementation in Python

A Pacman game implementation with an AI player using the Minimax algorithm. This project showcases the classic Pacman game environment, where the player (Pacman) navigates a maze to collect points while avoiding ghosts. The AI-controlled ghosts aim to catch Pacman.

this is a tictectoe project by using minmax (beat me if you can)

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

Quarto board game optimized with Genetic Algorithm and MinMax, plus Reinforcement-Learning.

this is my attempt at the game tic tac toe

A chess AI (currently in development) made in Python and GUI provided by Pygame.

A chess engine using pygame

MinMax Circular Sector Arc for External Plagiarism’s Heuristic Retrieval Stage code

🐋 A repository for useful algorithms and data structures

Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps or piles.

A project that allows the user to play a game of the pencil and paper game with the computer.

🐼 pandinha is a chess engine ♟️