Chess Engine Implementation using Minmax, Alpha-Beta Pruning, and Quiescence Search Algorithm.
德州扑克 AI 源码：C++ 博弈树、机器人 Agent、任务队列、Python CFR 训练与评估示例｜德州AI｜德州機器人｜Poker AI
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
TicTacToe with Game Tree
The Lichess analysis tree — turbocharged, optimized, and packaged as a standalone npm library with full PGN import/export.
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.
game tree search method - minmax, alphabeta, IDDFS
Projects that are based on writing an AI to solve a specific problem.
Visualiser for Solitaire game graphs
Python visualization library for OpenSpiel game trees, information sets, and strategy profiles
An Ultimate-TicTacToe AI with Monte Carlo Tree Search
An unbeatable game-playing AI built with Minimax, exploring optimal decision-making through game-tree search.
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.
To associate your repository with the game-tree topic, visit your repo's landing page and select "manage topics."