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 Carlo Tree Search. Implemented as a final project for the "Introduction to Aritifical Intelligence" course of the Hebrew University of Jerusalem.
Othello game in C++ and AllegroGL with MinMax "AI" (graph course project) — 2nd semester programming project for the second year at ECE Paris School of Engineering
These are some MATLAB implementations of functions related to Game Thory such as MinMax, Nash and Backwards Induction, which are applied in some exercises.
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 :)