Godot MCTS

A high-performance, general-purpose Monte Carlo Tree Search (MCTS) computer player engine and asynchronous background worker for turn-based games in Godot 4.

Includes an interactive Reversi (Othello) demonstration game with full UI parameter configuration, move highlighting, and live search diagnostics.

Try it out here

For a great overview of MCTS

• Go to Monte Carlo Tree Search in Machine Learning.

Features

• Game-Agnostic Core (MCTSPlayer): Adapts to any turn-based game ($N \ge 2$ players) via 4 simple Callables.
• Threaded Worker (MCTSRunner): Asynchronous background search node that keeps rendering and UI at a smooth 60+ FPS without hitching.
• Copy-on-Write Friendly: Fully compatible with immutable state designs.
• Deterministic Searches: Isolated RandomNumberGenerator with explicit seeding for reproducible multiplayer or regression testing.
• Cycle-Safe RefCounted Memory: Explicit tree cleanup prevents circular reference memory leaks between parent and child nodes.
• Comprehensive Diagnostics: Built-in move analysis tracking visit counts, exploration values, win rates, and search duration.
• Complete Reversi (Othello) Demo: Full playable game demonstrating Human vs Bot, Bot vs Bot spectator benchmarking, and parameter tuning.

Originally Created for the Turn-based Card Game

• Dank Dungeon of Darkness