LiTS: A Modular Framework for LLM Tree Search

In three linesLiTS is a modular Python framework for LLM reasoning via tree search. It decomposes search into three reusable components (Policy, Transition, RewardModel) compatible with MCTS and BFS. Tests on MATH500, Crosswords, and MapEval demonstrate component-algorithm orthogonality. Key finding: LLM policy diversity, not reward quality, is the bottleneck in infinite action spaces.

Summary generated by Claude — human-verified