Explaining Puzzle Solutions in Natural Language: An Exploratory Study on 6x6 Sudoku
Not on the map. Why?
Abstract (arXiv)
The success of Large Language Models (LLMs) in human-AI collaborative decision-making hinges on their ability to provide trustworthy, gradual, and tailored explanations. Solving complex puzzles, such as Sudoku, offers a canonical example of this collaboration, where clear and customized explanations often hold greater importance than the final solution. In this study, we evaluate the performance of five LLMs in solving and explaining sixsix Sudoku puzzles. While one LLM demonstrates limited success in solving puzzles, none can explain the solution process in a manner that reflects strategic reasoning or intuitive problem-solving. These findings underscore significant challenges that must be addressed before LLMs can become effective partners in human-AI collaborative decision-making.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 10 of its 19 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
10 of 19 references.
References · 10
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2023Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Promptingcited by 1,122
- 2018Explaining Explanations: An Overview of Interpretability of Machine Learningcited by 508
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 291
- 2024DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Datacited by 234
- 2024PuzzleVQA: Diagnosing Multimodal Reasoning Challenges of Language Models with Abstract Visual Patternscited by 57
- 2024Puzzle Solving using Reasoning of Large Language Models: A Surveycited by 45
- 2023Assessing Logical Puzzle Solving in Large Language Models: Insights from a Minesweeper Case Studycited by 15
Built on by
Citing papers per year: 2025: 3; 2026: 2.
5 papers.
- 2025LLM-Guided Reinforcement Learning with Representative Agents for Traffic Modelingcited by 2
- 2025Toward a Universal Characterization of Sudoku Puzzle Difficultycited by 0
- 2025PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Datacited by 0
- 2026Artificial Effortcited by 0
- 2026Position: Certified Correctness in Neural Constraint Reasoning Requires Symbolic Integrationcited by 0
- 2026Position: Certified Correctness in Neural Constraint Reasoning Requires Symbolic Integration2 Jun 2026
- 2026Artificial Effort17 Apr 2026
- 2025LLM-Guided Reinforcement Learning with Representative Agents for Traffic Modeling9 Nov 2025
- 2025PuzzleClone: A DSL-Powered Framework for Synthesizing Verifiable Data21 Aug 2025
- 2025Toward a Universal Characterization of Sudoku Puzzle Difficulty22 Jul 2025