A new benchmark parses LLM reasoning traces on Go life-and-death problems into search trees and shows that search organization, not token volume, distinguishes stronger reasoners.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
TsuGO: Probing Search Efficiency in LLM Reasoning via Go Life-and-Death Problems
A new benchmark parses LLM reasoning traces on Go life-and-death problems into search trees and shows that search organization, not token volume, distinguishes stronger reasoners.