jbradberry/mcts

Board game AI implementations using Monte Carlo Tree Search

46
/ 100
Emerging

Implements UCT (Upper Confidence bounds applied to Trees) algorithm with two evaluation strategies: win-count based and board-value based metrics. Integrates with the boardgame-socketserver ecosystem, exposing configurable players via command-line arguments for exploration coefficient (C), thinking time, and simulation limits. Supports multiple board games including Reversi, Connect Four, and Ultimate Tic Tac Toe through a modular architecture.

184 stars. No commits in the last 6 months.

Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 10 / 25
Maturity 16 / 25
Community 20 / 25

How are scores calculated?

Stars

184

Forks

33

Language

Python

License

MIT

Category

mcts-game-ai

Last pushed

Apr 19, 2020

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/jbradberry/mcts"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.