C++ Gomoku with a strong AI based on minimax search and alpha-beta pruning with Qt5 GUI. *Dozens of C++ tricks & hacks are used to improve efficiency.* Come and try to see if you can beat the powerful AI!

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

Chess game

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.

Unbeatable Tic Tac Toe game in java with gui

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…

A simple but smart TicTacToe game made using Flutter

#️⃣ㅤA C program for a game of TicTacToe using Artificial Intelligence

Chess game with React and min-max algorithm implementation

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

A panoply of algorithms in game theory, econometrics, linear programming, and Montecarlo simulations.

My version of Tic-Tac-Toe. built with Reactjs and Redux. Same old game, more possibilities.

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

chess ai utilizing minmax w/ alpha-beta pruning

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

Tic Tac Toe game that allows you to play against a bot using the Minimax algorithm or with a friend. This game is built with HTML, CSS, and JavaScript.

🏆 Make an AI capable of beating human players at Gomoku

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.

Baghchal implementation in Python

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