Structure-Induced Information for Rerooting Levin Tree Search

In three lines√LTS algorithm for tree search with implicit rerooting. Three rerooter designs proposed: clustering-based on state-space structure, heuristic-based with cost-to-go estimates, and hybrid. Avoids explicit subgoal generation, reduces computational overhead, and achieves state-of-the-art online training efficiency on tested domains.

Summary generated by Claude — human-verified