Project Patti: Why can You Solve Diabolical Puzzles on one Sudoku Website but not Easy Puzzles on another Sudoku Website?
Arman Eisenkolb-Vaithyanathan

TL;DR
This paper introduces two novel metrics based on SAT conversion and human-like solving strategies to quantify Sudoku difficulty, enabling consistent cross-website difficulty classification and providing an early solving algorithm.
Contribution
It proposes two new difficulty metrics for Sudoku puzzles and a universal rating system that aligns difficulty levels across different websites.
Findings
Strong correlation between proposed metrics and website difficulty labels for 4 out of 5 sites.
Universal difficulty classification effectively maps puzzles into Easy, Medium, Hard categories.
The approach enables consistent difficulty assessment across diverse Sudoku platforms.
Abstract
In this paper we try to answer the question "What constitutes Sudoku difficulty rating across different Sudoku websites?" Using two distinct methods that can both solve every Sudoku puzzle, I propose two new metrics to characterize Sudoku difficulty. The first method is based on converting a Sudoku puzzle into its corresponding Satisfiability (SAT) problem. The first proposed metric is derived from SAT Clause Length Distribution which captures the structural complexity of a Sudoku puzzle including the number of given digits and the cells they are in. The second method simulates human Sudoku solvers by intertwining four popular Sudoku strategies within a backtracking algorithm called Nishio. The second metric is computed by counting the number of times Sudoku strategies are applied within the backtracking iterations of a randomized Nishio. Using these two metrics, I analyze more than a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
