SPaRC: A Spatial Pathfinding Reasoning Challenge

Lars Benedikt Kaesberg, Jan Philip Wahle, Terry Ruas, Bela Gipp
5/22/2025
cs.AIcs.CL

No official code found. Best implementation: lkaesberg/SPaRC (5 stars, MIT, last commit 2026-04-28).

Abstract

Existing reasoning datasets saturate and fail to test abstract, multi-step problems, especially pathfinding and complex rule constraint satisfaction. We introduce SPaRC (Spatial Pathfinding Reasoning Challenge), a dataset of 1,000 2D grid pathfinding puzzles to evaluate spatial and symbolic reasoning, requiring step-by-step planning with arithmetic and geometric rules. Humans achieve near-perfect accuracy (98.0%; 94.5% on hard puzzles), while the best reasoning models, such as o4-mini, struggle (15.8%; 1.1% on hard puzzles). Models often generate invalid paths (>50% of puzzles for o4-mini), and reasoning tokens reveal they make errors in navigation and spatial logic. Unlike humans, who take longer on hard puzzles, models fail to scale test-time compute with difficulty. Allowing models to make multiple solution attempts improves accuracy, suggesting potential for better spatial reasoning with improved training and efficient test-time scaling methods. SPaRC can be used as a window into models' spatial reasoning limitations and drive research toward new methods that excel in abstract, multi-step problem-solving.

View on arXivView PDF

Code Implementations(1)

lkaesberg/SPaRCCommunity100%
MIT
53PythonMay 12, 20255 months agoMIT

Similar Papers

Cite this paper

@article{kaesberg2025sparc,
  title  = {SPaRC: A Spatial Pathfinding Reasoning Challenge},
  author = {Lars Benedikt Kaesberg and Jan Philip Wahle and Terry Ruas and Bela Gipp},
  year   = {2025},
  eprint = {2505.16686},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.16686v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.16686.svg)](https://codeofpaper.com/paper/2505.16686)

Discussion