XUNIK8/Reinforcement-Learning-in-Tsumego

利用强化学习、基于蒙特卡洛树搜索的UCT算法解决围棋死活题问题。Inplement improved Reinforcement Learning and UCT algorithms (based on Monte Carlo Tree Search) on Go/Tsumego problems

36
/ 100
Emerging

This project helps Go players and enthusiasts analyze and solve Tsumego (Go life-and-death problems). It takes a Tsumego problem as input and provides a visual simulation where a reinforcement learning AI, based on advanced Monte Carlo Tree Search, plays against itself or a human to determine the optimal solution. The output is a clear win/loss outcome (black wins or white wins) for the given problem, helping users understand complex Go positions.

No commits in the last 6 months.

Use this if you want an intelligent system to help you analyze and find solutions for challenging Go life-and-death problems.

Not ideal if you're looking for a general Go playing AI for full-length games rather than specific Tsumego problem-solving.

Go game Tsumego Go problem solving Board games Go strategy
Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 6 / 25
Maturity 16 / 25
Community 14 / 25

How are scores calculated?

Stars

15

Forks

3

Language

Python

License

Apache-2.0

Last pushed

Dec 26, 2022

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/XUNIK8/Reinforcement-Learning-in-Tsumego"

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