Research map / Learning theory and algorithms / Combinatorial and search optimization
Bidirectional Search That Is Guaranteed to Meet in the Middle
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| remove the 2g term from MM's node priority (MM-2g) (ablation) | MM · 10-Pancake, GAP-3, C*=10 | nodes expanded: 7,507 -> 106,539 | Hurt |
| remove the 2g term from MM's node priority (MM-2g) (ablation) | MM · 10-Pancake, GAP-2, C*=10 | nodes expanded: 6,723 -> 39,453 | Hurt |
| remove the 2g term from MM's node priority (MM-2g) (ablation) | MM · 10-Pancake, GAP, C*=10 | nodes expanded: 165 -> 165 | No clear effect |
| add a non-zero inaccurate heuristic to bidirectional brute-force search (MM0 -> MM) | MM0 · 10-Pancake, GAP-2, C*=10 | nodes expanded: 5,551 -> 6,723 | Hurt |
| add the GAP-1 heuristic to bidirectional brute-force search (MM0 -> MM) | MM0 · 10-Pancake, GAP-1, C*=10 | nodes expanded: 5,551 -> 2,448 | Helped |
| use MM instead of IDA* with h1997 | Rubik's Cube search · Rubik's Cube instance #10 (h1997) | nodes expanded: 70.3B -> 4.25B | Helped |
| use MM instead of MM0 with h1997 | bidirectional search · Rubik's Cube, easy (d=17) vs hard (d=18) instances | nodes expanded: 2.88B -> 4.25B (instance #10) | Mixed |
| use MM instead of IDA* with accurate h888 | Rubik's Cube search · Rubik's Cube instances #1 vs #9 (h888) | nodes expanded: 18.7M vs 96.0M (#1); 5.13B vs 2.87B (#9) | Mixed |
| use MM0 instead of Uni-BS | brute-force search · 10-Pancake, C*=10 | nodes expanded: 1,743,548 -> 5,551 | Helped |
Closest papers by meaning
- A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search (AAAI 2020 · similarity 0.91)
- Enriching Non-Parametric Bidirectional Search Algorithms (AAAI 2019 · similarity 0.89)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.88)
- Rectangle Search: An Anytime Beam Search (AAAI 2024 · similarity 0.84)
- Resource Constrained Pathfinding with Enhanced Bidirectional A* Search (AAAI 2025 · similarity 0.82)
- Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search (AAAI 2025 · similarity 0.82)
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.