{
  "id": 9055389,
  "title": "Expansion Counts under Standard A* Tie-Breaking Strategies on the Final Plateau",
  "url": "https://urgent.news/2026/09/20/expansion-counts-under-standard-a-tie-breaking-strategies-on-the",
  "topic": "ai",
  "section": "AI",
  "published": "2026-09-20T02:05:28.000Z",
  "source": {
    "name": "arXiv cs.AI",
    "slug": "arxiv-cs-ai",
    "url": "https://arxiv.org/abs/2609.23293v1"
  },
  "original_language": "en",
  "account": null,
  "summary": "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 over the other by an arbitrarily large additive expansion gap. A parameterized unit-cost grid example…",
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}