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.

Projects that are based on writing an AI to solve a specific problem.

Solo developed checkers game using game trees