Memory-Bounded A*

heuristic pathfinding algorithm

Facts

7 properties
🏷️ Also known as
en MA* en Memory-Bounded A* de MA* fr MA* it MA* pl Algorytm MA* uk алгоритм з обмеженням пам'яті

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Based on 1
Computes solution to 1
Described by source 1
Different from 1
Instance of 1
Named after 1
Subclass of 1
Subtypes 1
Press Enter · cited answer in seconds

Summary

Memory-Bounded A is an informed search algorithm[1]. Memory-Bounded A

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Memory-Bounded A*. Retrieved May 3, 2026, from https://4ort.xyz/entity/memory-bounded-a
MLA “Memory-Bounded A*.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/memory-bounded-a.
BibTeX @misc{4ortxyz_memory-bounded-a_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Memory-Bounded A*}}, year = {2026}, url = {https://4ort.xyz/entity/memory-bounded-a}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Memory-Bounded A* — https://4ort.xyz/entity/memory-bounded-a (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/memory-bounded-a · Last refreshed: