Graph-Based Exploration for ARC-AGI-3 Interactive Reasoning Tasks
Evgenii Rudakov, Jonathan Shock, Benjamin Ultan Cowley

TL;DR
This paper introduces a graph-based, training-free method for solving interactive reasoning tasks in the ARC-AGI-3 benchmark, demonstrating significant performance improvements over LLM-based agents by systematic exploration and state tracking.
Contribution
The paper presents a novel, explicit graph-structured exploration approach that does not rely on learning, effectively addressing complex interactive reasoning tasks.
Findings
Solves a median of 30 out of 52 levels on ARC-AGI-3.
Ranks 3rd on the private leaderboard.
Outperforms frontier LLM-based agents significantly.
Abstract
We present a training-free graph-based approach for solving interactive reasoning tasks in the ARC-AGI-3 benchmark. ARC-AGI-3 comprises game-like tasks where agents must infer task mechanics through limited interactions, and adapt to increasing complexity as levels progress. Success requires forming hypotheses, testing them, and tracking discovered mechanics. The benchmark has revealed that state-of-the-art LLMs are currently incapable of reliably solving these tasks. Our method combines vision-based frame processing with systematic state-space exploration using graph-structured representations. It segments visual frames into meaningful components, prioritizes actions based on visual salience, and maintains a directed graph of explored states and transitions. By tracking visited states and tested actions, the agent prioritizes actions that provide the shortest path to untested…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsMultimodal Machine Learning Applications · Reinforcement Learning in Robotics · AI-based Problem Solving and Planning
