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 Carlo Tree Search. Implemented as a final project for the "Introduction to Aritifical Intelligence" course of the Hebrew University of Jerusalem.

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

Recombining and concurrent Monte Carlo tree search

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

AI for the Connect 4 game

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

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

六洲棋AI，使用AlphaZero风格的深度强化学习

No description provided.

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

Simple implementation of MCTS in checkers

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

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

Monte Carlo tree search (MCTS) for Elixir.

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

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

MCTS/minimax turn-based game AI for Java

Sentiment Analysis & Monte Carlo Tree Search with Nested Rollout Policy Adaptation for Business

Easy to understand Python implementation for Predictor + UCT (PUCT), inspired by AlphaZero.

A Hex board game with a customizable Monte Carlo Tree Search (MCTS) agent with optional leaf parallelization in C++. Includes a logging functionality for MCTS insights.

Monte Carlo Tree Search

:sandwich: A tool to generate sandwich recipes for Pokémon Scarlet & Pokémon Violet

An AI of hexagon gobang, using mcts

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

In this project, my primary goal was to implement an AI player class powered by the Monte Carlo Tress Search algorithm which can play for a win as well as defend a defeat to compete with a Human player.

🎮 Enhance decision-making in game environments with the Predictor + UCT (PUCT) library, simplifying research in Monte Carlo Tree Search.

Tic-tac-toe/"noughts & crosses" written in Clojure (CLI + deps). AI powered by Monte Carlo tree search algorithm

The AI agent for LaCiteDeDieu brings smart gameplay using ⚡ai algorithms and 🧠 heuristics. It can face off against 🎮 humans or 🤖 other AIs.

Cranes problem with Monte Carlo Tree Search algorithm