We present an algorithm computing a shortest path between to vertices in a square grid graph with edge weights that uses memory less than linear in the num- ber of vertices (apart from that for storing in the in- put). For any ε > 0, our algorithm uses a work space of O(n(1/2)+ε) words and runs in O(nO(1/ε)) time.