This document presents the Simplified Memory Bound A* algorithm, an extension of A* that uses available memory to store paths. It stores the shortest path in memory if possible, otherwise the best path that fits. With sufficient memory, it has the same speed as A*, but will return the best path that fits if full memory is not available.