Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Haskell
Wiki community
Recent changes
Random page
HaskellWiki
Search
Search
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Sudoku/Thorkil Naur
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Special pages
Page information
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Solving: Reduction and trials == Solving works by reducing the size of the sets that represent possible field contents in a sequence of steps. A solution has been found when each set contains exactly one element. If reduction alone fails to produce a solution, a single trial step is taken: A field with (the fewest number of) non-single possiblities is selected and each possibility is tried one by one. For each possibility, renewed reduction is performed recursively, possibly leading to further trial steps and so on, until a solution is found. The solutions produced by each trial are combined, thus all solutions will be found. This solution strategy is implemented by the sdkSolve function.
Summary:
Please note that all contributions to HaskellWiki are considered to be released under simple permissive license (see
HaskellWiki:Copyrights
for details). If you don't want your writing to be edited mercilessly and redistributed at will, then don't submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
DO NOT SUBMIT COPYRIGHTED WORK WITHOUT PERMISSION!
Cancel
Editing help
(opens in new window)
Toggle limited content width