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!

• UpdatedAug 3, 2020
• C++

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

• UpdatedOct 3, 2024
• Python

Chess game

• UpdatedFeb 7, 2025
• Java

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.

• UpdatedDec 19, 2020
• Python

Unbeatable Tic Tac Toe game in java with gui

• UpdatedJun 27, 2017
• Java

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…

• UpdatedAug 22, 2020
• Python

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

• UpdatedJun 23, 2018
• C

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

• UpdatedAug 6, 2022
• Python

A simple but smart TicTacToe game made using Flutter

• UpdatedSep 13, 2023
• Dart

Chess game with React and min-max algorithm implementation

• UpdatedSep 24, 2021
• JavaScript

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

• UpdatedJan 8, 2023
• TypeScript

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

• UpdatedJan 24, 2023
• CSS

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

• UpdatedMay 18, 2021
• Python

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

• UpdatedMar 25, 2020
• Python

🧠 chess ai utilizing minmax w/ alpha-beta pruning

• UpdatedDec 11, 2025
• 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.

• UpdatedSep 13, 2025
• Python

Baghchal implementation in Python

• UpdatedApr 3, 2023
• Python

🏆 Make an AI capable of beating human players at Gomoku

• UpdatedApr 30, 2018
• C++

This is a simple JavsScript based Tic-Tac-Toe game. We used Minimax Algorithm to make a bot to play against. This way, the user plays with a clever bot than a bot that takes random moves.

• UpdatedMar 15, 2025
• JavaScript

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.

• UpdatedOct 15, 2024
• HTML