Loading patterns…
Reflective Monte Carlo Tree Search(R-MCTS)
Enhanced MCTS with contrastive reflection for improved exploration
In 30 seconds
- What
- Expands a decision tree by sampling paths, then reflects on contrasts between successful and failed branches to guide future exploration.
- When to use
- Complex strategic problems requiring deep exploration of many options where you can evaluate partial solutions and learn from their differences.
- Watch out
- Computational cost grows rapidly with tree depth and branching factor, often exceeding gains unless reflection meaningfully prunes the search space.
Ask the AI expert about this pattern
Opens the assistant with your question prefilled. You review it before sending.
Reflective Monte Carlo Tree Search: Overview
Enhanced MCTS with contrastive reflection for improved exploration
- Contrastive reflection mechanism
- Enhanced exploration strategies
- Self-improving search
- Quality-guided tree expansion
- Adaptive selection policies
- Gains that scale with how branchy the search space is
The Agent Architect
One pattern, one tradeoff, one production failure story. A short weekly briefing for people building agentic systems.
Weekly email, one-click unsubscribe. We only use your address to send the briefing.
References
The papers, specifications, and repositories this pattern is based on.
From the engineer behind this catalog
Get your agent architecture reviewed
This page documents one pattern. Your system runs dozens, and most failures live in how they fit together. Have the whole design reviewed against the 288 patterns in this catalog: architecture, reliability, evaluation and cost, every finding mapped to the pattern that fixes it.
€750 instead of €1,500, one week, written report and walkthrough call, until 30 September