A solver for the game of Tak as described in Patrick Rothfuss's Kingkiller Chronicles.
-
Updated
Mar 3, 2018 - Python
A solver for the game of Tak as described in Patrick Rothfuss's Kingkiller Chronicles.
Monte Carlo Tree Search algorithm applied to a simplified version of Blizzard's Hearthstone. Explores various types of greedy AI agents to learn from and beat down. A part of Reinforcement Learning class at Wrocław University of Science and Technology
This repository contains the AI engine for a simplified version of Heartstone game
Implementation of an AlphaGo Zero paper in one C++ header file without any dependencies
An AI of hexagon gobang, using mcts
MCTS/minimax turn-based game AI for Java
Reversi player using Monte Carlo Tree Search
the full monte - a generic MCTS library for game AIs with (planned) concurrency and network support
Strong Aritifical Intelligence for Checkers created using Upper Confidence Tree algorithm with GUI.
AI for the Connect 4 game
Simple implementation of MCTS in checkers
An implementation of Monte Carlo Tree Search for Domineering written for a competition organized by Johannes stöhr.
An RL bot based off of Monte Carlo Tree Search for the Go board game, from scratch
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
Monte Carlo tree search (MCTS) for Elixir.
This is my entry winning CodeCup competition 2021 with the game Zuniq
Cranes problem with Monte Carlo Tree Search algorithm
Add a description, image, and links to the mcts-implementations topic page so that developers can more easily learn about it.
To associate your repository with the mcts-implementations topic, visit your repo's landing page and select "manage topics."