Player vs CPU Tic-Tac-Toe game using the Minimax Algorithm with Alpha-Beta Pruning.
-
Updated
Mar 30, 2017 - C
Player vs CPU Tic-Tac-Toe game using the Minimax Algorithm with Alpha-Beta Pruning.
This is a checkers game, that use minimax seach with alpha-beta prunning.
A CECP amateur chess engine
Lichess BOT engine
an Java AI Bot implementation for mancala (kalah) game using alpha-beta pruned minimax algorithm
Adversarial search agent to play the game "Isolation": minimax search, minimax + alpha-beta pruning + iterative deepening
The standard Tic-Tac-Toe-Game & Matryoshka-Variation, each as multiplayer games and with AI opponents are included, respectively. Written in Processing.
an adversarial search agent to play the game "Isolation"
Othello Game (Also known as Reversi). It was created with the Minimax algorithm (Alpha-Beta pruning). Allows Human-AI, AI-AI, RandomPlayer-AI, RandomPlayer-Human interplay
EECS 348: Intro to Artificial Intelligence, Assignment 2 (Python)
A game of knight's Isolation between two AIs, to test minimax alpha-beta search and Monte Carlo tree search
Unbeatable Tic Tac Toe. Single-page HTML, CSS & JavaScript
project submitted at AIND (May cohort)
Chess AI using neural networks to predict move value
A chess game implemented using Django and the minimax algorithm
Solve 2048 using minimax and alpha beta pruning
Connect Four Game AI Implementation with Javascript, Using Minimax Algorithm and Alpha-Beta Pruning
Add a description, image, and links to the minimax-search topic page so that developers can more easily learn about it.
To associate your repository with the minimax-search topic, visit your repo's landing page and select "manage topics."