A Study Of Sudoku Solving Algorithms: Backtracking and Heuristic
Abstract
This paper presents a comparative analysis of Sudoku-solving strategies, focusing on recursive backtracking and a heuristic-based constraint propagation method. Using a dataset of 500 puzzles across five difficulty levels (Beginner to Expert), we evaluated performance based on average solving time. The heuristic approach consistently outperformed backtracking, achieving speedup ratios ranging from 1.27x in Beginner puzzles to 2.91x in Expert puzzles. These findings underscore the effectiveness of heuristic strategies, particularly in tackling complex puzzles across varying difficulty levels.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.