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

Rust software for solving impartial games.

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

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

goita core in Go

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

An Ultimate-TicTacToe AI with Monte Carlo Tree Search

game tree search method - minmax, alphabeta, IDDFS

TicTacToe with Game Tree

Tic Tac Toe game with AI

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

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.

The unbeatable TicTacToe with the MiniMax Algorithm

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

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

School project on search-based problem-solving.

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