A fast C++ impementation of Monte Carlo Tree Search with abstract classes that a user of this library can extend in order to use it. To demonstrate it I apply it to the game of Quoridor.

In this project we try to create a sophisticated computer agent to play the Contact Bridge card game. Our goal is to develop an agent that is tough to play against, with fast reaction time so it is able to play in real time against humans. We approached this as a search problem, and implemented search-tree heuristics based on Minimax and Monte C…

Recombining and concurrent Monte Carlo tree search

Companion repository of the "Dancer in the Dark" paper.

A solver for the game of Tak as described in Patrick Rothfuss's Kingkiller Chronicles.

AI for the Connect 4 game

Implementation of an AlphaGo Zero paper in one C++ header file without any dependencies

This is my entry winning CodeCup competition 2021 with the game Zuniq

the full monte - a generic MCTS library for game AIs with (planned) concurrency and network support

The content of this repository will be inherent to the Computational Intelligence course at Polytechnic University of Turin academic year 2023/2024

Monte Carlo tree search (MCTS) for Elixir.

A connect-4 gaming AI based on Monte Carlo Tree Search

Strong Aritifical Intelligence for Checkers created using Upper Confidence Tree algorithm with GUI.

AI implementation using monte carlo tree search (MCTS) for the Game of Amazons

Monte Carlo Tree Search

MCTS/minimax turn-based game AI for Java

An AI of hexagon gobang, using mcts

Work in Progress. Implementation of the Monte Carlo Tree Search, a decision making algorithm.

Simple implementation of MCTS in checkers