A classic Connect Four game featuring two-player mode and an AI opponent powered by Monte Carlo Tree Search (MCTS), offering an exciting and strategic gameplay experience.
-
Updated
Jan 21, 2025 - Java
8000
A classic Connect Four game featuring two-player mode and an AI opponent powered by Monte Carlo Tree Search (MCTS), offering an exciting and strategic gameplay experience.
Chinese Checkers computer player implementing Monte Carlo Tree Search
Java based alpha zero reinforcement learning. The core module suppports implementing any adversary board game. Example implementation for Tic Tac Toe.
A powerful Java framework to build zero-sum game AI engines. Includes ready-to-use search algorithms, UCI support, and tools that simplify complex engine development.
Ultimate Tic Tac Toe for Android
Abstract Strategy Board Games
MCTS/minimax turn-based game AI for Java
Tic-Tac-Toe game using the Monte Carlo Tree Search algorithm, implemented in Java.
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.
Reversi monte carlo tree search for android
This is the AI we created for a university course. It plays the famous game, Kalah.
MCTS for query rewrite
This repository contains the AI engine for a simplified version of Heartstone game
Java AI player for the Game of Amazons using Monte Carlo Tree Search and heuristic evaluation.
model-based RL solvers for some card games
Add a description, image, and links to the mcts topic page so that developers can more easily learn about it.
To associate your repository with the mcts topic, visit your repo's landing page and select "manage topics."