Chess Engine Implementation using Minmax, Alpha-Beta Pruning, and Quiescence Search Algorithm.
Rust software for solving impartial games.
Solve the N-puzzle (best known as the 8 puzzle game) using a min priority queue and the A* search algorithm
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.
TicTacToe with Game Tree
The Lichess analysis tree — turbocharged, optimized, and packaged as a standalone npm library with full PGN import/export.
game tree search method - minmax, alphabeta, IDDFS
Python visualization library for OpenSpiel game trees, information sets, and strategy profiles
An Ultimate-TicTacToe AI with Monte Carlo Tree Search
Projects that are based on writing an AI to solve a specific problem.
Kiothi — A traditional Meru mancala game from Kenya with pre-game setup, nki capture protection, and chain captures. Educational HTML game with AI and lesson plan.
Algoritmo que analisa a melhor jogada para um tabuleiro de jogo da velha por meio de uma árvore de jogadas.
C++ Artificial Intelligence coursework implementing Greedy Best-First Search with Manhattan heuristics and Minimax for a modified Nim game.
The unbeatable TicTacToe with the MiniMax Algorithm
To associate your repository with the game-tree topic, visit your repo's landing page and select "manage topics."