MCTS
Name variants Monte Carlo tree search · Monte-Carlo Tree Search
arXiv:2503.23326v4 Announce Type: replace Abstract: Monte-Carlo Tree Search (MCTS) is a family of sampling-based search algorithms widely used for online planning in sequential decision-making domains and at the heart of many recent advances in artificial intelligence. Understanding the behavior of MCTS agents is difficult for developers and users due to the
This explanation quotes or summarizes the cited source record. Saving creates a bookmark on this device, with no automatic account sync.
- First observed in our collection
- Nov 18, 2026, 7:12 PM UTC
- Earliest cited publication
- Nov 18, 2026, 5:00 AM UTC
- Last observed
- Nov 18, 2026, 7:12 PM UTC
Evidence in the last complete seven days
- Source mentions
- 2 Previous seven days 0
- Distinct sources
- 1 Previous 0
- Comparable growth
- Not comparable
- Ranking appearances
- 0
Collection observations and undated records are separate from dated publication counts. Observed in 7d:2 · Undated records:0
Collection coverage · Comparable windowsCurrent / previous observed days 7 / 7
Counts use complete UTC days. First observed means first seen by this collection, not when a term was coined.
Current window:2026-11-12 → 2026-11-19 (end excluded) · History 31 days
| Source | Current days | Previous days | Last success |
|---|---|---|---|
| arXiv | 6 | 7 | Nov 18, 2026, 7:13 PM UTC |
| arXiv | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| Ask HN | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Ask HN | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Ask HN | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Ask HN | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Digg | 3 | 0 | Nov 18, 2026, 7:14 PM UTC |
| GitHub | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Issues | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Releases | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Issues | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Releases | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Issues | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Releases | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| GitHub Discovery | 7 | 7 | Nov 19, 2026, 1:25 AM UTC |
| GitHub Trending | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| 7 | 7 | Nov 18, 2026, 7:13 PM UTC | |
| Hackobar | 3 | 0 | Nov 19, 2026, 1:25 AM UTC |
| Hugging Face | 4 | 7 | Nov 18, 2026, 7:13 PM UTC |
| Hugging Face Spaces | 5 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Hacker News | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Hacker News | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Hacker News | 7 | 7 | Nov 19, 2026, 1:25 AM UTC |
| Hacker News | 7 | 7 | Nov 19, 2026, 1:25 AM UTC |
| Show HN | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Microlaunch | 3 | 0 | Nov 19, 2026, 1:25 AM UTC |
| MIT News | 7 | 6 | Nov 18, 2026, 7:13 PM UTC |
| OpenAI | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| Product Hunt | 7 | 7 | Nov 19, 2026, 1:25 AM UTC |
| 量子位 | 7 | 5 | Nov 18, 2026, 7:13 PM UTC |
| OpenRouter | 6 | 7 | Nov 17, 2026, 6:17 PM UTC |
| GitHub Trending | 1 | 7 | Nov 12, 2026, 4:00 AM UTC |
| Hugging Face Models | 5 | 7 | Nov 19, 2026, 1:25 AM UTC |
| HF Daily Papers | 5 | 6 | Nov 19, 2026, 1:25 AM UTC |
| OpenRouter | 7 | 7 | Nov 19, 2026, 1:25 AM UTC |
| Product Hunt | 1 | 7 | Nov 12, 2026, 4:00 AM UTC |
| SEC EDGAR | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| Sequoia Capital | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| Simon Willison | 7 | 7 | Nov 18, 2026, 7:14 PM UTC |
| TechCrunch | 7 | 7 | Nov 19, 2026, 1:24 AM UTC |
| Techmeme | 3 | 0 | Nov 19, 2026, 1:25 AM UTC |
| Trendshift | 3 | 0 | Nov 19, 2026, 1:25 AM UTC |
| Contracts Finder | 7 | 7 | Nov 18, 2026, 7:13 PM UTC |
| Uneed | 3 | 0 | Nov 19, 2026, 1:25 AM UTC |
| V2EX | 5 | 7 | Nov 19, 2026, 1:24 AM UTC |
- Counts describe monitored public sources, not the whole web or search demand.
Daily history · up to 90 days
Bars show dated source mentions. The latest UTC day may be incomplete. Zero mentions and missing collection coverage are different conditions.
View accessible daily data
| UTC date | Mentions | Sources | Observations | Ranking appearances |
|---|---|---|---|---|
| 2026-11-05 | 0 | 0 | 0 | 0 |
| 2026-11-06 | 0 | 0 | 0 | 0 |
| 2026-11-07 | 0 | 0 | 0 | 0 |
| 2026-11-08 | 0 | 0 | 0 | 0 |
| 2026-11-09 | 0 | 0 | 0 | 0 |
| 2026-11-10 | 0 | 0 | 0 | 0 |
| 2026-11-11 | 0 | 0 | 0 | 0 |
| 2026-11-12 | 0 | 0 | 0 | 0 |
| 2026-11-13 | 0 | 0 | 0 | 0 |
| 2026-11-14 | 0 | 0 | 0 | 0 |
| 2026-11-15 | 0 | 0 | 0 | 0 |
| 2026-11-16 | 0 | 0 | 0 | 0 |
| 2026-11-17 | 0 | 0 | 0 | 0 |
| 2026-11-18 | 2 | 1 | 2 | 0 |
| 2026-11-19 | 0 | 0 | 0 | 0 |
Source evidence
Sources in the evidence shown:arXiv 2
arXiv · Published Nov 18, 2026
Exploring Explainable Multi-agent MCTS-minimax Hybrids in Board Game Using Process Mining
arXiv:2503.23326v4 Announce Type: replace Abstract: Monte-Carlo Tree Search (MCTS) is a family of sampling-based search algorithms widely used for online planning in sequential decision-making domains and at the heart of many recent advances in artificial intelligence. Understanding the behavior of MCTS agents is difficult for developers and users due to the
View source record →arXiv · Published Nov 18, 2026
MCTS Is Counting the Wrong Thing: Learning Exploration Counts for LLM Reasoning
arXiv:2611.22301v1 Announce Type: new Abstract: Monte Carlo tree search (MCTS) has powered landmark successes in reinforcement learning, yet its gains in LLM reasoning can remain modest despite substantial search effort. We identify an overlooked bottleneck: what MCTS counts. Standard UCT assigns independent visit counts to textual branches, allowing differe
View source record →
Review priority 44 / 100
This score orders research candidates. It is not search volume, a forecast or verified commercial demand.
Evidence
12.7 / 30Distinct dated articles or first observations; repeat crawling adds nothing.
Publisher diversity
8 / 25Conservative owner grouping; syndicated copies count once.
Comparable change
0 / 20Comparable complete weeks only; no percentage from a zero baseline.
Recent evidence
14.7 / 15Latest publication or first observation, not repeated fetch time.
Name specificity
8.8 / 10Explicit entities and technical concepts outrank ambiguous acronyms.
Limitations and interpretation
- First observation is a collection milestone, not proof that a word or product is new to the world.
- Counts describe monitored public sources, not the whole web or search demand.
- First observed here is not the invention date of a name or idea.
- Candidates come from public titles, summaries and entity URLs, not verified full-text analysis.
- Owner grouping is conservative; undisclosed syndication may remain.
- The previous week is too small for a reliable percentage change.
- Current evidence comes from one publisher or owner.