Pith. sign in

REVIEW 1 cited by

Minuet: A method to solve Sudoku puzzles by hand

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.06778 v3 pith:ADYPMHZY submitted 2018-12-13 cs.DM cs.DS

classification cs.DMcs.DS
keywords puzzlessolvemethodminuethandsudokualgorithmsauthor
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a systematic method to solve difficult 9 x 9 Sudoku puzzles by hand. While computer algorithms exist to solve these puzzles, these algorithms are not good for human's to use because they involve too many steps and require too much memory. For humans, all one can find in the literature are individual tricks, which used together in ad hoc ways can be used to solve some puzzles--but not all. To the author's knowledge, a systematic procedure made up of well-defined steps that can be carried out by hand and solve all puzzles has not been devised. This paper proposes one such technique--the "minuet" method. It is based on a new system of markings and a new way of simplifying the puzzles that can be easily carried out by hand--or by computer. The author has solved hundreds of puzzles of the most difficult kind ("evil" in Sudoku's parlance) and never found one that could not be solved. The average time to solve one of these puzzles is slightly over 1 hour. It is conjectured that this method can solve all well-posed 9 x 9 puzzles. The method's distinguishing feature is a "minuet" strategy that is applied when the puzzle cannot be further simplified with basic tricks. The strategy consists in concurrently developing two potential solutions, sometimes alone and sometimes in concert as if they were dancing a minuet.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Project Patti: Why can You Solve Diabolical Puzzles on one Sudoku Website but not Easy Puzzles on another Sudoku Website?

    cs.AI 2025-07 conditional novelty 4.0 of 10

    A randomized Nishio solver's strategy-cycle count correlates strongly with website difficulty labels for four of five Sudoku sites, enabling a three-tier universal difficulty classification.

Pith tools