AI for Playing Russian Checkers (aka "Shashki")
Rust software for solving impartial games.
a C++ chess engine with support for full chess rules and an AI opponent. It implements move generation, position evaluation, and a minimax search with alpha-beta pruning to choose the best moves. This project is designed to be modular and extensible.
game tree search method - minmax, alphabeta, IDDFS
MiniMax checkers AI with alpha-beta pruning
Deriving an optimal Blackjack strategy using Tammelin's counterfactual regret minimization algorithm (CFR+) and modern C++.
Tic Tac Toe minimax
Board games in python using GameTree to find the best moves
The code repository for my rouse research project, addressing the question: "How effective are machine learning algorithms compared with traditional analytical techniques, with respect to playing abstract games?"
In this project we evaluated how far modern AlphaZero type algorithms are from prefect solution.
Military chess AI based on minimax search
Artificial Intelligence (Old)
Course work for SSU's CS480 which is a survey of techniques that simulate human intelligence.
Add a description, image, and links to the game-tree-search topic page so that developers can more easily learn about it.
To associate your repository with the game-tree-search topic, visit your repo's landing page and select "manage topics."