arXiv (All)
open access
Expansion Counts under Standard A* Tie-Breaking Strategies on the Final Plateau
In the A* search algorithm, the tie-breaking strategies for nodes with the same $f$-value determines which states A* expands on the final $f$-layer. For nine standard tie-breaking strategies, we show that under a consistent heuristic, every pair has positive-cost instances favoring each strategy ove
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Compact Partial Symmetry Breaking for Graph Search Problems#1035952
- Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries#1064362
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Distributed Lower Bounds via Automatic Self-Reduction#1129011
- Distributed Lower Bounds via Automatic Self-Reduction#1108707
Record · ID 1049036
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive