You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
15 lines
583 B
Markdown
15 lines
583 B
Markdown
---
|
|
# edu-3yw9
|
|
title: 'Write §2: Monte Carlo Tree Search — algorithm explained'
|
|
status: completed
|
|
type: task
|
|
priority: normal
|
|
created_at: 2026-03-13T20:03:17Z
|
|
updated_at: 2026-03-13T22:48:46Z
|
|
parent: edu-coqp
|
|
---
|
|
|
|
Step-by-step walkthrough of MCTS: selection (UCB1), expansion, simulation/rollout, backpropagation. Include a worked example on a small game tree.
|
|
|
|
## Summary of Changes\n\nWrote full content for §2 covering MCTS algorithm: the four phases (selection, expansion, simulation, backpropagation), UCB1/UCT formula, worked ASCII tree example, and strengths/limitations.
|