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.
The standard Tic-Tac-Toe-Game & Matryoshka-Variation, each as multiplayer games and with AI opponents are included, respectively. Written in Processing.
project submitted at AIND (May cohort)
Pacman and Ghost Agent | Python | Artificial Intelligence | Search-based Algorithms | Learning-based Algorithms
Whirlwind game made in Java
EECS 348: Intro to Artificial Intelligence, Assignment 2 (Python)
An AI bot to play the game of YINSH using optimised alpha beta pruning based minimax search.
Unbeatable Tic Tac Toe. Single-page HTML, CSS & JavaScript
an adversarial search agent to play the game "Isolation"
an Java AI Bot implementation for mancala (kalah) game using alpha-beta pruned minimax algorithm
Project: Build a Game-playing Agent | Artificial Intelligence Nanodegree | Udacity
Solve 2048 using minimax and alpha beta pruning
Connect Four Game AI Implementation with Javascript, Using Minimax Algorithm and Alpha-Beta Pruning
This repo is where I'll be doing most of my AI homework. Working together with python and various learning algorithms
Minimax algorithm and alpha-beta pruning are applied to solve competing vacuum cleaners that want to clean a room from dirts.
Game-playing Agent. Implementing Minimax Search and AlphaBeta Pruning techinques for solving
Adverserial agent for isolation game
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."