Research map / Learning theory and algorithms / Combinatorial and search optimization
Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model
Felix Mohr, Viktor Bengs, Eyke Hüllermeier
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use PL-MCTS with the mean preference-kernel statistic instead of DNG | MCTS path search · TTSPB, 20 locations | relative score: 0.21±0.26 -> 0.16±0.26 | Improved |
| use PL-MCTS with the mean preference-kernel statistic instead of DNG | MCTS path search · TTSPB, 30 locations | relative score: 0.27±0.26 -> 0.15±0.25 | Improved |
| use PL-MCTS with the mean preference-kernel statistic instead of DNG | MCTS path search · TTSPB, 50 locations | relative score: 0.25±0.31 -> 0.15±0.28 | Improved |
| use PL-MCTS with the mean preference-kernel statistic instead of NRPA-3 | MCTS path search · VRDJS, 2 machines | relative score: 0.18±0.05 -> 0.14±0.32 | Improved |
| use PL-MCTS with the mean preference-kernel statistic instead of NRPA-3 | MCTS path search · VRDJS, 5 machines | relative score: 0.18±0.03 -> 0.13±0.28 | Improved |
| use PL-MCTS with the mean preference-kernel statistic instead of NRPA-3 | MCTS path search · VRDJS, 9 machines | relative score: 0.21±0.04 -> 0.19±0.35 | Improved |
| use PL-MCTS with the mean preference-kernel statistic instead of TAG | MCTS path search · SameGame, 10x10 | relative score: 0.14±0.24 -> 0.85±0.27 | Hurt |
| use PL-MCTS with the mean preference-kernel statistic instead of TAG | MCTS path search · SameGame, 15x15 | relative score: 0.46±0.23 -> 0.62±0.26 | Hurt |
| use PL-MCTS with the mean preference-kernel statistic instead of TAG | MCTS path search · SameGame, 20x20 | relative score: 0.61±0.17 -> 0.74±0.18 | Hurt |
| use mean minus standard deviation instead of mean for ranking child nodes (ablation) | PL-MCTS · TTSPB, 20 locations | relative score: 0.16±0.26 -> 0.14±0.25 | Improved |
| use the minimum instead of mean for ranking child nodes (ablation) | PL-MCTS · SameGame, 15x15 | relative score: 0.62±0.26 -> 0.77±0.25• | Hurt |
Closest papers by meaning
- An Analysis of Monte Carlo Tree Search (AAAI 2017 · similarity 0.92)
- Monte Carlo Tree Search in the Presence of Transition Uncertainty (AAAI 2024 · similarity 0.90)
- Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves (AAAI 2025 · similarity 0.89)
- Online Robust Reinforcement Learning Through Monte-Carlo Planning (ICML 2025 · similarity 0.88)
- Monte-Carlo Tree Search with Uncertainty Propagation via Optimal Transport (ICML 2025 · similarity 0.88)
- Graph-Based Stochastic-Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation (NeurIPS 2026 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
