Solving 9/6 Jacks or Better
-
Updated
Jun 23, 2024 - C++
Solving 9/6 Jacks or Better
A simple command-line chess game implemented in C++. It allows you to play against an AI player using basic chess rules.
In this project, we develop a player logic for a variant of the Morris game using AI concepts.
Creating an "AI" using minimax algorithm to never lose at Connect4
This is a Tic_Tac_Toe game engine.
Computing optimal strategy for the dice game 421
Ultimate Tic-Tac-Toe against AI
A terminal based Tic-Tac-Toe game that allows the user to battle against 3 engines of varying difficulty as well as play another human
C++ implementation of MinMax algorithm that solves TicTacToe
Using alpha-beta pruning search algorithm to play the board game.
Implemented Min-max algorithm to assist the AI agent to make its next move in Chess
Military chess AI based on minimax search
This repo contains code to play the game tic-tac-toe in the terminal agains an AI using the minmax algorithm.
Adversarial search algorithms on board games
A fun game played between Computer and Player in which the Computer is always unbeaten!
A simple 3*3 tic-tac-toe game implemented with C++.
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!
Add a description, image, and links to the minmax-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the minmax-algorithm topic, visit your repo's landing page and select "manage topics."