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

School project on search-based problem-solving.

The unbeatable TicTacToe with the MiniMax Algorithm

Project files for CSCI 5454 - Design and Analysis of Algorithms (Fall 2017)

Solve the N-puzzle (best known as the 8 puzzle game) using a min priority queue and the A* search algorithm

Chess player that generates optimal move against an opponent through the use of a game tree and alpha-beta pruning. The algorithm can be used against human or other computer-generated players.

TicTacToe with Game Tree

Algoritmo que analisa a melhor jogada para um tabuleiro de jogo da velha por meio de uma árvore de jogadas.

Artificial Intelligence- Game Play and Propositional Logic

Tic Tac Toe game with AI

人工智能_八数码_井字棋博弈树

goita core in Go

A game player for two-player perfect information games, implemented using a min-max game tree, alpha-beta pruning, and a transposition table, along with a variety of heuristics.

Implementation of Tic Tac Toe and AI players using C++. The AI players can use the Minimax algorithm and Monte Carlo Tree Search.

UniBO Algorithms and Data Structure project. Intelligent M,N,K-game player using cutting-edge algorithms for optimal strategy

A project for the requirements of CS Intelligent Systems that lets a human play against an AI in Checkers. The agent uses Game Trees through Min/Max and Alpha-Beta Pruning.

Checkers with AI.

University of Birmingham - Software Workshop Game

The classic tic-tac-toe game using Minimax Algorithm