# Memory-Bounded A*

> heuristic pathfinding algorithm

**Wikidata**: [Q88874547](https://www.wikidata.org/wiki/Q88874547)  
**Source**: https://4ort.xyz/entity/memory-bounded-a

## Summary
Memory-Bounded A* (MA*) is a heuristic pathfinding algorithm in the A* family that is designed to operate under memory constraints. It is an informed search algorithm based on and named after the A* search algorithm and is used to compute solutions to shortest-path problems.

## Key Facts
- Alias: MA*.
- Instance of: informed search algorithm and pathfinding algorithm.
- Based on and subclass of: the A* search algorithm.
- Named after: the A* search algorithm.
- Primary problem solved: computes solutions to the shortest path problem.
- Described in: Artificial Intelligence: A Modern Approach (reference indicated, p. 101).
- Classified as a heuristic algorithm: uses preliminary (heuristic) information as an informed search method.
- Different from: Simplified Memory-Bounded A* (listed as a distinct entity).
- Related class: informed search algorithm — a type of search algorithm in which preliminary information (generally heuristic) is available.

## FAQs
### Q: What is Memory-Bounded A*?
A: Memory-Bounded A* (MA*) is a heuristic, informed pathfinding algorithm in the A* family that is intended to operate with limits on memory while solving shortest-path problems.

### Q: How is Memory-Bounded A* related to A*?
A: MA* is based on and a subclass of the A* search algorithm. It is named after A* and belongs to the same family of algorithms used for pathfinding and graph traversal.

### Q: Is Memory-Bounded A* the same as Simplified Memory-Bounded A*?
A: No. Memory-Bounded A* is listed as a different entity from Simplified Memory-Bounded A*, which is itself described as a heuristic pathfinding algorithm with bounded memory.

### Q: Where can I find a description of Memory-Bounded A*?
A: Memory-Bounded A* is described in the textbook Artificial Intelligence: A Modern Approach (reference given, p. 101).

## Why It Matters
Memory-Bounded A* matters because it brings the heuristic, shortest-path solving strengths of the A* family into contexts where memory is limited. As an informed search technique, MA* leverages heuristic information to guide search toward goal states, while the memory-bounded aspect addresses practical constraints on available storage during graph or path searches. This combination is relevant in applications where optimal or good-quality shortest-path solutions are needed but available memory prevents the straightforward use of full A*. By occupying the intersection of informed heuristics and memory-aware design, Memory-Bounded A* provides a practical option for real-world pathfinding and graph traversal tasks that operate under resource constraints. It is part of the broader set of A*-derived algorithms documented in standard AI literature, making it a recognizable variant for researchers and practitioners concerned with constrained-search environments.

## Notable For
- Being a memory-aware member of the A* family (alias MA*), explicitly tied to A* by name and design.
- Being an informed search algorithm that targets shortest-path problems using heuristic information.
- Being documented in mainstream AI literature (Artificial Intelligence: A Modern Approach, p. 101).
- Being identified as distinct from Simplified Memory-Bounded A*, indicating multiple memory-bounded variants exist.

## Body
### Overview
- Memory-Bounded A* (MA*) is a heuristic pathfinding algorithm.
- It is part of the A* family and is explicitly named after A*.
- The algorithm is characterized as an informed search method.

### Classification and relationships
- Instance of: informed search algorithm; pathfinding algorithm.
- Based on: A* search algorithm.
- Subclass of: A* search algorithm.
- Related to: the general class "informed search algorithm," which uses preliminary heuristic information.
- Different from: Simplified Memory-Bounded A* (a separate, related entity described as a heuristic pathfinding algorithm with bounded memory).

### Purpose and problem domain
- Primary computational goal: computes solutions to the shortest path problem.
- Application domain: pathfinding and graph traversal tasks that leverage heuristic guidance.

### Documentation
- Source reference: Described in the textbook Artificial Intelligence: A Modern Approach (reference indicated, p. 101).

### Terminology
- Common alias: MA*.
- "Memory-Bounded" indicates a design focus on operating under limited memory, as reflected by the algorithm's placement within memory-aware variants of A*.