Stories
Slash Boxes
Comments

News for nerds, stuff that matters

Slashdot Log In

Log In

Create Account  |  Retrieve Password

Solving Sudoku With dpkg

Journal written by Otter (3800) and posted by timothy on Sat Aug 23, 2008 09:38 PM
from the after-all-it's-there dept.
Reader Otter points out in his journal a very neat use for the logic contained in Debian's package dependency resolver: solving sudoku puzzles. To me at least, this is much more interesting than the sudoku puzzles themselves. Update: 08/24 02:51 GMT by T : Hackaday just ran a story that might tickle the same parts of your brain on a game played entirely with MySQL database queries.
+ -
story

Related Stories

This discussion has been archived. No new comments can be posted.
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
 Full
 Abbreviated
 Hidden
More
Loading... please wait.
  • Uh-oh (Score:3, Funny)

    by Yvan256 (722131) on Saturday August 23 2008, @09:41PM (#24723565) Homepage Journal

    1. Computers can generate Sudokus
    2. Computers can solve Sudokus
    3. Skynet determines that humans are useless. It then creates what is called "virtual worlds" in a campaign to exterminate the global human population birth rate.

    • I hate to be pedantic (ok, no I don't, I love it), but since it's a Japanese word, the plural of Sudoku is Sudoku. Also, there should be a macron on the u, but that's way less important.
      • Who ever said that when you're speaking English you have to apply the rules of pluralization for whatever language you're borrowing a loan word from? We do it sometimes, but not always. We also mix latin prefixes with greek root words sometimes (which gets George Orwell's panties in a twist, but I'm pretty sure I don't care). If the plural is commonly accepted as "sudoku" (is there precedent on this yet?) then we do it the Japanese way in this case. But there's no reason that just because the word comes

        • Re:Uh-oh (Score:4, Interesting)

          by Koiu Lpoi (632570) <koiulpoi@NETBSDgmail.com minus bsd> on Saturday August 23 2008, @11:30PM (#24724017)

          Then try this on for size: I believe that "sudoku" is a mass noun, much like all nouns in Japanese. In other words, you can't say "two sudokus" any more than you can say "two softwares" or "two mashed potatoes". You need a counter word, such as "two sudoku puzzles", which you'd have to use (something very similar) in Japanese anyways.

          And besides, let's be honest. "Sudokus" sounds retarded.

  • by Shag (3737) <dan.birchalls@net> on Saturday August 23 2008, @09:46PM (#24723585) Homepage

    Sudoku isn't a math puzzle, it's a logic puzzle - just one where you're filling in digits instead of the man in the blue house smoking Pall Malls and having a goldfish.

    The digits 1-9 in Sudoku could be replaced with any 9 other symbols without changing the underlying rules. So yeah, logic can be used to solve it.

    • Sodokus are typically solved by using logic and identifying relationships, but the article describes a clumsy brute force method. I will admit that I'm splitting 'mathematical' hairs here, and that it is an amusing thought to readapt Debian's simple dependency resolver, but crude solving functions, that simply guess at every possible solution, are fairly boring when compared to clever logic with elegant methods, that can solve sudokus in a fraction of time.
      • Ultimately this approach simply encodes the rules of sudoku, and the state of an unsolved sudoku puzzle in logic statements, and then passes it off to a reasonably general logic solver, namely the dependency/conflict resolver in apt-get/aptitude. That's not really brute force at all.

        Whether or not the solution is "brute force" depends on the manner in which debian's dependency/conflict resolver operates. There's many approaches to solving this problem, from gross brute force to reasonably complex machine le

        • by Nymz (905908) on Saturday August 23 2008, @10:31PM (#24723775) Journal

          Sudoku doesn't have clever logic and elegant methods.

          Check out the various strategies listed on this Sudoku Solver. [scanraid.com]

          Don't mod me down if you disagree. If you disagree, consider writing a retort instead.

          You must be new here. Only posters that take the time to back up conclusions with reasoned responses are moderated down. Conversely, those that write short, unsupported attacks are moderated up... because in reality most people can only be trusted with 2 tags - I agree or I disagree.

          • There are certainly some tricks to do it, but if you're starting with a fairly empty board then early on it does tend to end up as a lot of guesswork. There's a reason the game is best played with a pencil, and I've used nothing but pen in every math class I've ever taken.

            • There's a reason the game is best played with a pencil, and I've used nothing but pen in every math class I've ever taken.

              The paper quality of newspapers and sudoku booklets is thin and brownish, so pencil marks aren't very easy to see, and erasing on cheap paper is a disaster. At first I resisted using a pen, but now I'd never go back.

            • Re: (Score:3, Informative)

              It's very rare that I have found the need to guess in a Sudoku. I've never seen a printed one in a newspaper where that was necessary - even the 'diabolical' ones.

              Certainly I've made mistakes on some, and a couple of times I've run out of ideas and had to make a guess, but on running it through my own program, it's got the solution without taking guesses.

              There is a good online solver at http://www.sudokusolver.co.uk/ [sudokusolver.co.uk] that explains how it solves any Sudoku that you enter. This has a couple more methods to

        • Re:Splitting Hairs (Score:5, Interesting)

          by whatnotever (116284) on Saturday August 23 2008, @10:35PM (#24723797)

          Sudoku can be solved by trying values in cells until a conflict is reached and backtracking to try other assignments. That's the brute-force approach.

          Most sudoku puzzles can be solved via implication, however. There is no need to "try" anything. Certain configurations of values in some cells can imply values in other cells. As a very simple example, consider a row that has all cells filled but one. The value of that unfilled cell is implied and can be filled in without having to try any other values. This is a basic example, but clearly more complex ones exist. This is essentially how people solve the puzzles, and I believe it is what the grandparent was describing.

          However, I do not believe that the grandparent is correct in stating that these methods solve sudokus in a fraction of the time of the brute force method if you allow for standard optimizations of the brute force method as developed for constraint processing (CP) or Boolean satisfiability (SAT) solvers. But then again, many of those optimizations are similar to the "clever logic and elegant methods," especially those that perform propagation and follow implications.

          Sudoku doesn't have clever logic and elegant methods. There is only one method for solving sudoku puzzles, and it strongly resembles a computer doing brute force.

          Don't mod me down if you disagree. If you disagree, consider writing a retort instead.

          It would have been nice if you had written something backing up your own claim as well.

          • Re: (Score:3, Insightful)

            However, I do not believe that the grandparent is correct in stating that these methods solve sudokus in a fraction of the time of the brute force method if you allow for [...]

            Well, run some tests then ;) Seriously, though: as you point out yourself, if you add some simple heuristics to the brute-forcing it ceases being brute-force. Guess what, the heuristics for solving Sudoku problems (you've pointed one out yourself) eventually run out, and you have to guess and backtrack or brute-force in some other way.

            If we compare the completely vanilla brute force (that's 9^(n^2) tries where n^2 is the number of squares) with the heuristics-plus-brute-force, you may get something better

            • I guess I'm just annoyed by these people who think that they are thinking, and am trying to burst their bubble.

              I already learned all the chords on the guitar,
              --and I'm just annoyed by these people who think that practicing will make me any better.

              I already learned how to swim,
              --and I'm just annoyed by these people who think that practicing will help me win an Olympic Medal.

              Steven Hawking was simply born as a fully formed genius,
              --and I'm just annoyed by these people who think that his thinking everyday has helped him achieve anything... but bursting your bubble. :-)

        • Elegant methods (Score:5, Insightful)

          by SeanAhern (25764) on Saturday August 23 2008, @10:36PM (#24723811) Journal

          Sudoku doesn't have clever logic and elegant methods. There is only one method for solving sudoku puzzles, and it strongly resembles a computer doing brute force.

          Sure, there are brute force methods. They are often techniques that dive into deep "consequence" trees to find contradictions. Those are, by their very nature, annoying for people to do and thus attractive for computer solutions. Nishio, tables, all of those just make sudoko boring and feel like you're executing a computer program in your limited-RAM brain.

          But those aren't the "clever" or "elegant" methods. Sudoku techniques that I would consider elegant are things like sashimi x-wings, XYZ-wings, the various type of unique rectangles, and such. I enjoy trying to discover patterns like these in really tricky sudoku problems. I expect I'm not the only one, given the popularity of the puzzle over the last few years.

          If you want to get really deep, you can use sudoku puzzles to explore mathematical group theory.

          All of this (and what you said in your post) are true for other puzzles such as the Rubik's cube. Perfectly suitable for machine automation, but still fun for some of us us lowly humans as well.

        • Re: (Score:3, Informative)

          The "Propagating Constraints" section of this article is quite a bit less brute force than the "search" section:

          http://norvig.com/sudoku.html [norvig.com]

    • Re: (Score:3, Informative)

      Sudoku isn't a math puzzle, it's a logic puzzle - just one where you're filling in digits instead of the man in the blue house smoking Pall Malls and having a goldfish.

      The digits 1-9 in Sudoku could be replaced with any 9 other symbols without changing the underlying rules. So yeah, logic can be used to solve it.

      How did this get modded insightful? Just because numbers don't have to be used doesn't mean it's not math.

      Sudoku is a set theory [wikipedia.org] problem

      • Just because numbers don't have to be used doesn't mean it's not math.

        You must be a mathematician [xkcd.com]. :)

        Sudoku is a set theory [wikipedia.org] problem

        Yes, but set theory is a subfield of mathematical logic [wikipedia.org], which came about when people decided to apply logic to their math (before which all math was presumably illogical, and used only irrational numbers). And in studying, you would have learned that this sort of logic puzzle most likely predates the existence of set theory by some number of centuries, so I clearly cannot choose the wine in front of me.

      • by azgard (461476) on Sunday August 24 2008, @01:33AM (#24724421)

        Actually, Sudoku is a http://en.wikipedia.org/wiki/Vertex_coloring [wikipedia.org] for a special graph. From mathematics perspective, it is thus pretty boring, although that doesn't mean it cannot be fun.

      • Re: (Score:3, Insightful)

        Keeps your logic skills sharp. It's good mental exercise, in the vein of Brain Age and such... Gotta keep that noggin fit, especially if your day job isn't challenging you enough.

  • by Asuranceturix (1265166) on Saturday August 23 2008, @10:17PM (#24723717)

    And he didn't even use Super Cow Powers to do it!

    • Finally, someone who GETS it.

      I wanted to comment "Let's see rpm do that!" but before I could click, I realized that dpkg by itself cannot solve puzzles of any kind.

      To the idiot who modded this "overrated," please pull your head out of your ass and type "aptitude --help" when you get a chance.

      To everyone else, please tag this article "badtitle."

      • Allow me to clarify parent and grand-parent for those of you who don't read articles:

        As a proof-of-concept, I have written a hacky Python script, named debsudoku.py, that can convert ksudoku saved games into Packages files suitable for use with apt-get or aptitude.

        (Source: TFA, at http://algebraicthunk.net/~dburrows/blog/entry/package-management-sudoku/ [algebraicthunk.net])

        Emphasis added. Note that dpkg doesn't solve the dependency puzzle, but apt-get, aptitude and other package managers do (including synaptic and gnome-app-install [the "Add/Remove" thing]). Hence the suggested badtitle (which I agree with).

        The 'aptitude --help' bit and the super cow powers: if you run 'apt-get moo', you'll get a cows

  • by fabs64 (657132) <beaufabry+slashdot,org&gmail,com> on Saturday August 23 2008, @10:56PM (#24723901)
    Let's seem yum do THAT!

    I kid I kid.
    • It probably could, but you'd have to wait ten times longer than it took to solve the problem for it to download all the headers first.

  • by suck_burners_rice (1258684) on Saturday August 23 2008, @11:07PM (#24723951)
    This is very cool! Kind of like implementing the Towers of Hanoi in vim or something. I'm going to test it against some puzzles from this here handy dandy Sudoku book. Now if only someone would make a Chess solver out of dpkg. You choose any out of the huge number of possible mate layouts and it will compute the dependencies from the start of the game to that mate layout! Implementing this should be so obvious that only a total fool won't immediately see how to do it, so it is left as an exercise for the reader.
  • Make (Score:5, Funny)

    by michaelmalak (91262) <malak@acm.org> on Sunday August 24 2008, @12:10AM (#24724139) Homepage
    Probably also could be done using Make, which is really an expert system in disguise. Ant-heads won't know what I'm talking about. (Mod to +5 Flamebait.)
  • Dpkg in NP hard?! (Score:3, Insightful)

    by mdmkolbe (944892) on Sunday August 24 2008, @12:12AM (#24724147)

    Since Sudoku is NP complete, doesn't this mean Dpkg is NP complete?!

    Oh, the humanity! I'm just waiting for an evil set of dependencies to crop up that makes it go exponential.

    • Sudoku, in the way that it's being solved here and how most people think of it (with 9 digits and 3x3 boxes), is not NP-complete. Its board size is finite, so there are a bounded number of possibilities to try (fewer than (9!)^9), so there exists a constant-time algorithm (trying every one of the possibilities, of which there must be less than 9!^9). But if you want to generalize to nxn boards, that changes things considerably.

  • Time to plug myself (Score:3, Interesting)

    by gringer (252588) on Sunday August 24 2008, @03:20AM (#24724779)

    Here's my attempt at a solver / generator (Java backend, with a console frontend, a graphical frontend, and a j2me frontend):

    http://cons.org.nz/~gringer/ [cons.org.nz]

    I don't actually find sudoku puzzle *solvers* all that interesting, because they are able to do the solution by brute-force. Sudoku puzzle *generators*, on the other hand, tend to be more difficult, because one requirement for the traditional puzzles is that the puzzle must only have one solution. For puzzle generators that rely on brute-force for their solvers, this "only one solution" requirement is difficult to enforce.

    Just to demonstrate this, see the following bug:
    http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=351043 [debian.org]

    • Because cheats impress babes. left-right-left-right-a-b-start! left-right-left-right-a-b-start! I think I feel tingley.
    • by jlarocco (851450) on Saturday August 23 2008, @10:10PM (#24723677) Homepage

      First, it's not "cheat codes".

      Second, I, and I'm sure I'm not alone on this, would rather write a program to solve sudoku than actually play sudoku. Some people love sudoku; I found it boring. Now writing software to solve a puzzle, that's interesting.

      • by Drakonik (1193977) <drakonik@gmail.com> on Saturday August 23 2008, @10:28PM (#24723765) Homepage

        Exactly. This guy doesn't care about the sudoku puzzle, he cares about the programming puzzle.

        • Re: (Score:3, Interesting)

          The article is really a nerd article, and now we all have a challenge!

          What is YOUR software solution to solve Soduku puzzles? Think outside the box, or go for the classic brute force method.

          I would think about using languages like Erlang or Prolog to solve the problem, but classic languages with iterating over the alternatives will do also. Pick your poison!

          • by seasunset (469481) on Sunday August 24 2008, @07:07AM (#24725447) Homepage

            I suppose nothing will beat Prolog with constraint logic programming to concisely solve Sudoku [wordpress.com].

            Actually, let me put the whole code here from the above blog post:

            sudoku(P) :-
              fd_domain(P,1,9),
              Xs = [1,2,3,4,5,6,7,8,9],
              row(P,Xs),
              col(P,Xs),
              unit(P,Xs),
              fd_labeling(P).

            row(_,[]).
            row(P,[X|Xs]) :-
              setof(V,[C,I]^(for(C,1,9),I is (X-1)*9+C,nth(I,P,V)),L1),
              fd_all_different(L1),
              row(P,Xs).

            col(_,[]).
            col(P,[X|Xs]) :-
              setof(V,[R,I]^(for(R,1,9),I is (R-1)*9+X,nth(I,P,V)),L2),
              fd_all_different(L2),
              col(P,Xs).unit(_,[]).

            unit(P,[U|Us]) :-
              Cs is ((U-1) mod 3)*3+1, Ce is Cs+2,
              Rs is ((U-1) // 3)*3+1, Re is Rs+2,
              setof(V,[R,C,I]^(for(R,Rs,Re),for(C,Cs,Ce),I is (R-1)*9+C,nth(I,P,V)),L),
              fd_all_different(L),
              unit(P,Us).

      • Re: (Score:3, Interesting)

        Also, if you're going to write a Sudoku puzzle generator, you have to write a Sudoku solver first. New puzzles are created by coming up with a random valid solved Sudoku puzzle, removing a bunch of numbers, checking to see if it's still solvable, and then removing some more...rinse, wash, repeat...
        • Not really, while that is one way of doing it, there are other ways of solving the problem.

          It's probably less costly to take a square away at a time and check to see if it's still solvable than to populate a random start and see if it's possible to solve it. And probably less complicated as well.

          The actual logic involved would be very different, and with this way you'd be able to reuse calculations from before by just checking the rows and box affected by the change to make sure that you can still get that

          • by omeomi (675045) on Saturday August 23 2008, @11:24PM (#24724007) Homepage
            It's probably less costly to take a square away at a time and check to see if it's still solvable than to populate a random start and see if it's possible to solve it. And probably less complicated as well.

            Isn't that pretty much exactly what I said? Create a random valid solved puzzle, then start removing squares...
            • by Anonymous Coward

              You don't need a full solver to create a solved puzzle, I should think. Just start with the most basic puzzle and make legal permutations of it:


              123|456|789
              456|789|123
              789|123|456
              ---+---+---
              231|564|897
              564|897|231
              897|231|564
              ---+---+---
              312|645|978
              645|978|312
              978|312|645

              For example, you should be able to swap any two numbers everywhere.

      • Re: (Score:2, Interesting)

        Interesting? Writing a SAT program to solve sudoku takes less than five minutes. This is not an interesting puzzle for a computer.
        • Re: (Score:3, Interesting)

          Let me get that straight, if you can't solve a problem it's a bad problem ?

          How would you feel then if someone else did solve the problem that you could not solve ? Is it still a poor puzzle then ?

          I read what you are saying as 'I like sudoku, but only the simple ones because I'm not clever enough to hold more than a few permutations of it in my head'...

    • Well, I wrote an algorithm (web interface here [fennecfoxen.org]) to solve it and it was an interesting enough process. :)

      (Darned fast little program, too. Won a trivial little prize with it.)

    • by _xeno_ (155264) on Saturday August 23 2008, @10:19PM (#24723727) Homepage Journal

      RTFA. I know, I know, what am I suggesting, it's Slashdot.

      Here's the quick version: Russell Coker remarked [coker.com.au] that "a package management system that can solve Sudoku based on package dependency rules is not something that I think would be useful or worth having."

      Daniel Burrows realized that apt could, in fact, currently be used to solve Sudoku puzzles [algebraicthunk.net], and wrote a Python script to automate the process of creating the packages required to do such a thing. That's the linked article, and it gives the background I'm repeating here.

      I, personally, think it's pretty damned cool. Useless, but cool.

      And, as the article points out, there exist better Sudoku solving algorithms. apt is a rather poor Sudoku solver, mainly because it's designed to come up with the "best" dependency resolution rather than solve Sudoku. It's not to "cheat" at Sudoku, but rather to demonstrate the power of the apt dependency resolver.

    • by Drakonik (1193977) <drakonik@gmail.com> on Saturday August 23 2008, @10:26PM (#24723759) Homepage

      It isn't about beating sudoku. It's about taking one tool, and using it to do something that its creators never imagined.

      It's the same reason people use laser cutters to slice their pizza or try to create the shortest possible quine in their language of choice. This guy might not even give a shit about sudoku; he just wanted to see if he was clever enough to solve sudoku using dpkg.