Minimal number of clues for Sudokus
Abstract: In this article we will present a universal scheme for calculating the minimal number of clues needed for a generalized Sudoku to be uniquely solvable. By using equivalence partitioning and analyzing uniqueness properties of patterns, we will reduce the search space to a feasible size. As a result, we will present the minimal number for 2 × 4 Sudokus.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Minimal number of clues for Sudokus ; volume:2 ; number:2 ; year:2012 ; pages:143-151 ; extent:9
Open computer science ; 2, Heft 2 (2012), 143-151 (gesamt 9)
- Creator
-
Lass, Christoph
- DOI
-
10.2478/s13537-012-0011-y
- URN
-
urn:nbn:de:101:1-2410301514581.684625119411
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:35 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lass, Christoph