Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!

 



Forgot your password?
typodupeerror
×
Japan Math Supercomputing Idle Entertainment Science

Lower Limit Found For Sudoku Puzzle Clues 121

ananyo writes "An Irish mathematician has used a complex algorithm and millions of hours of supercomputing time to solve an important open problem in the mathematics of Sudoku, the game popularized in Japan that involves filling in a 9X9 grid of squares with the numbers 1–9 according to certain rules. Gary McGuire of University College Dublin shows in a proof posted online [PDF] that the minimum number of clues — or starting digits — needed to complete a puzzle is 17; puzzles with 16 or fewer clues do not have a unique solution. Most newspaper puzzles have around 25 clues, with the difficulty of the puzzle decreasing as more clues are given."
This discussion has been archived. No new comments can be posted.

Lower Limit Found For Sudoku Puzzle Clues

Comments Filter:
  • by JoshuaZ ( 1134087 ) on Sunday January 08, 2012 @01:56PM (#38630904) Homepage
    This isn't a proof that really gives us any understanding of the problem. They used various symmetries of the problem to reduce how many cases they'd need to check and then checked it for all cases using a lot computing power (without reducing the cases there are around 10^33 separate cases to check (since 81 choose 17 is around 10^17 and 9^17 is around 10^16) .So they did due some good work in reducing the case set, but they still had a lot left over. A result of this brute force approach this means that there's no obvious way to generalize this proof to get the minimum number needed when one has n^2 symbols in general. Proofs really should give us insight into why statements are true, and this one really doesn't. That's not to knock on the accomplishment: this clearly took a lot of effort, some very smart work, and some clever use of group theory and very skilled programming.
    • by Anonymous Coward on Sunday January 08, 2012 @02:00PM (#38630956)

      This is true.

      But you dismiss the fact that hard proofs are often done gradually: it's usually easier to prove something you know beforehand than take a stab at the dark.

      What I mean is, now that this brute force approach has shown that 9^2 requires at least 17 to get a general solution, then we can now go on to prove it using standard methods.

      • by Anonymous Coward on Sunday January 08, 2012 @03:58PM (#38631764)

        Given that Sudoku with a generalized base of size N (IE, not necessarily 9 symbols but N symbols in an N^2xN^2 grid with blocks of size N) has been shown to be NP complete since 2002 (http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/SIGAL87-2.pdf), I find it unlikely that even N=3 sudoku (given how rapidly NP complete problems scale in difficulty relative to a given N) will have any small elegant general solution, as literally speaking, all satisfiability problems up to a certain (small) size can be framed within it. It is possible, but IMHO highly unlikely.

        • by JoshuaZ ( 1134087 ) on Sunday January 08, 2012 @04:13PM (#38631848) Homepage
          This doesn't follow. The question here isn't the general question of solving a generalized Sudoku grid (which is NP complete) but rather the problem of the minimum size needed for a unique solution. This isn't the same problem. It could very well be that there's an easy answer to this question and that the numbers follow some easy pattern (like say 2n-1 for n symbols).
    • by JoshuaZ ( 1134087 ) on Sunday January 08, 2012 @02:00PM (#38630958) Homepage
      Er, I made a mistake here. One just needs to check this for 16 clues, so 81 choose 16, and 9^16 are the numbers one cases about, so one gets around 10^30. The other important thing to note is that this is the set of possible clue arrangements. Not all of these lead to valid sudokus at all. There are only around 10^21 of those.
    • by The Askylist ( 2488908 ) on Sunday January 08, 2012 @02:15PM (#38631082)
      Pretty much like the proof of the four colour theorem, then. A really good proof would be able to show a solution for n dimensions, where n > 2, but all we have as a proof is an exhaustive enumeration of the possible networks in 2 dimensions. Most unsatisfying, to those of us who like to see analytical proofs that don't rely on mechanical methods, but there you go. It's still a clever bit of work, and the technique may come in useful elsewhere, but I'd rather see a pencil and paper proof any day.
      • by rmstar ( 114746 ) on Sunday January 08, 2012 @03:27PM (#38631524)

        A really good proof would be able to show a solution for n dimensions, where n > 2, but all we have as a proof is an exhaustive enumeration of the possible networks in 2 dimensions. Most unsatisfying, to those of us who like to see analytical proofs that don't rely on mechanical methods.

        While I am inclined to agree with you, the thing is that there is no a priori reason why such a proof should exist. We should be happy that a proof exists at all.

        For some additional perspective on this, here is a very readable article by Chaitin on his Omega number [maths.org]. (Since this is a divulgation article, it may be advisable to read first his short bio at the end, otherwise this may seem crackpottery to some).

      • by abell ( 523485 ) on Monday January 09, 2012 @05:18AM (#38635920)

        A really good proof would be able to show a solution for n dimensions, where n > 2, but all we have as a proof is an exhaustive enumeration of the possible networks in 2 dimensions.

        The four color theorem only makes sense in 2 dimensions, since for 3 and more no number of colors is enough. To visualize this, just take any number n of spheres in 3D, add appendices to them so that each sphere touches all the other ones, without intersection, fill-in the voids with whatever you want (by thickening the appendices or with a new region) and you end up needing at least n different colors.

    • by Trepidity ( 597 ) <[gro.hsikcah] [ta] [todhsals-muiriled]> on Sunday January 08, 2012 @02:22PM (#38631136)

      I agree on the final result, but there may be something interesting in the symmetries developed, which the researchers seem to suggest involved some interesting and/or novel techniques. If true, that could have broader applications; reducing seemingly large search spaces to equivalent smaller search spaces by taking advantages of symmetries is a recurring motif in computational X for lots of X, so if they have new techniques there that could be useful.

    • by epine ( 68316 ) on Sunday January 08, 2012 @03:55PM (#38631720)

      Proofs really should give us insight into why statements are true, and this one really doesn't. That's not to knock on the accomplishment: this clearly took a lot of effort, some very smart work, and some clever use of group theory and very skilled programming.

      This comment reminds me that it's not what you have, it's what you do with it. Sometimes you hear about an athlete that he or she has "an extra gear" in the heat of battle. I went to school with a lot of smart people. The median smart person would sometimes make a lazy statement of sentiment such as this one that would never have passed the lips of my classmates with the hard-baked intellectual edge. Hard-baked was part talent, but mostly attitude: people who just thought that the lazy use of "should" was beneath their level of intellectual determination (as it should be, in my personal opinion).

      Obviously the landmark results in mathematics are the ones which forge a deep connection between branches of mathematics formerly distinct. Every proof should be one of those. Or at least that's how the coke addict would phrase it. Mathematics as Willy Wonka's chocolate factory. Who needs peas? No candy cane construction permitted by the Chocolate Port Authority if less intriguing that Dessin d'enfant [wikipedia.org].

      This discovery, which is technically so simple, made a very strong impression on me, and it represents a decisive turning point in the course of my reflections, a shift in particular of my centre of interest in mathematics, which suddenly found itself strongly focussed. I do not believe that a mathematical fact has ever struck me quite so strongly as this one, nor had a comparable psychological impact. This is surely because of the very familiar, non-technical nature of the objects considered, of which any childâ(TM)s drawing scrawled on a bit of paper (at least if the drawing is made without lifting the pencil) gives a perfectly explicit example. To such a dessin we find associated subtle arithmetic invariants, which are completely turned topsy-turvy as soon as we add one more stroke.

      I arrived at this page yesterday evening beginning my tour with a question about the provability of reachable states, the mechanism of temporal logic, Zermelo's contribution to set theory, the Hilbert epsilon operator, the Bourbaki group (before Sheldon Cooper there was Jean Dieudonne), and finally to Grothendieck. I have a fairly clear recollection of reading a long piece about Grothendieck several years ago which lamented the loss to mathematics when he devoted the bulk of his career to elaborating a program in algebraic geometry instead of cracking one hard problem after another, which it seemed some people thought he could do. He was regarded by some as much too brilliant for the pedestrian task of assembling an overarching synthesis.

      All mathematicians should be more like Grothendieck should have been. Doesn't that sentiment become quickly cloying once you engage the mental clutch?

      A year ago another tour took me to Knuth's algorithm of dancing links, which I compiled out of curiosity, then modified the decision step with the next most obvious heuristic. I was interested to watch the famous dancing links during a back-tracking step, so I searched the internet for a famously hard Sudoku example, found one, then single-stepped through the solution process in the debugger. I was disappointed: it reached solution without once backtracking. I think it made three guesses in total, either binary or trinary. I vaguely recall the odds of it guessing correctly all the way to solution was about ten to one. I loaded some other hard problems. On these it actually backtracked from time to time, but not as often I would have presumed. Even hard problems fall quickly to structured guess-work. It's only when you map Sudoku into a logic inference framework that hard problems are hard.

      In the Kolmo

    • by Anonymous Coward on Sunday January 08, 2012 @04:17PM (#38631888)

      You are confounding proof and theory. Proofs establish something as true and that is it. What you want is a theory consisting of many theorems that each say something about the Sudoku problem, because then you would feel that you have a better understanding. You are knocking on their accomplishment when you criticize them for not providing a whole theory of the problem. In fact their approach is superior to offering a theory of the problem, because it increases our understanding of computer approaches to proofs - far more important than any one mathematical problem. Welcome to the future.

    • by Anonymous Coward on Sunday January 08, 2012 @04:47PM (#38632112)

      > never done anything of note in mathematics.
      > criticizes those who have for not "providing enough insight."

      Rock on with your bad self, Corky. I'm sure the guys who developed this proof are going to lose sleep over what some psuedo-intellectual giant on Slashdot thinks of their methods.

  • by jcreus ( 2547928 ) on Sunday January 08, 2012 @01:56PM (#38630916)
    High-tech computers, working uninterruptedly for about 10 years, have finally discovered the exact minimum number of clues for the binary sudoku [xkcd.com].
  • by Anonymous Coward on Sunday January 08, 2012 @01:59PM (#38630940)

    After a long day at work I prefer my Sudoku with 80+ clues

  • by drfuchs ( 599179 ) on Sunday January 08, 2012 @02:01PM (#38630970)
    But that does not mean that in all puzzles with more than 17 clues you can remove a clue and still have a unique solution. This makes the last sentence in the main post kind of meaningless; plenty of (x+1)-clue puzzles are harder than some x-clue ones.
    • by Anonymous Coward on Sunday January 08, 2012 @03:28PM (#38631536)

      No, they proved that there are no puzzles with 16 clues that have a unique solution. There are plenty of puzzles with more clues that don't have a unique solution. e.g. a sudoku with columns 8 and 9 missing. So removing a clue from a 55 clue puzzle could lead to a puzzle with no unique solution.

    • by kasperd ( 592156 ) on Monday January 09, 2012 @06:35AM (#38636192) Homepage Journal

      But that does not mean that in all puzzles with more than 17 clues you can remove a clue and still have a unique solution.

      No. If you first fill in all 81 numbers with a random choice among the valid possibilities and then remove clues in a random order as long as you can do so without making the puzzle ambiguous, then you will usually end up with 24 or 25 numbers where none can be removed without making it ambiguous. That also explains why the ones you usually see have that number of clues.

      But there are more questions to be asked. I have written code to generate sudokus using the above algorithm. I end up with between 22 and 28 numbers, though most of the time it is 24 or 25. But ending up with twentysomething numbers depends on the order I removed numbers. Maybe if I removed them in a different order, I would have been able to remove more. So can every combination of the full 81 fields be reduced to just 17 if you just find the right 64 to remove? If not what is the maximum number that would be required? And is there an efficient algorithm to find the smallest possible number of clues for a specific combination of the 81 numbers?

  • Cue the morons. (Score:5, Insightful)

    by Beelzebud ( 1361137 ) on Sunday January 08, 2012 @02:07PM (#38631012)
    I see we already have one idiot asking "what's the point", much like John McCain or Sarah Palin asking why we need to research the fruit fly genome, or put money into a planetarium. This is news for nerds. If you want to whine about tax money, and don't understand why fundamental research is important, then find some place else to stink up with your ignorance.
    • by Osgeld ( 1900440 ) on Sunday January 08, 2012 @02:08PM (#38631026)

      yes this money was well spent to figure out one of man's most complex problems ... a fucking brain teaser

      • Re:Cue the morons. (Score:5, Insightful)

        by Beelzebud ( 1361137 ) on Sunday January 08, 2012 @02:16PM (#38631086)
        RTFA, if it's not too much of a fucking brain teaser for you. There is a little nugget at the end.

        "McGuire says that his approach may pay off in other ways. The hitting-set idea that he developed for the proof has been used in papers on gene-sequencing analysis and cellular networks, and he looks forward to seeing if his algorithm can be usefully adapted by other researchers. “Hopefully this will stimulate more interest,” he says. "
        • Re:Cue the morons. (Score:5, Informative)

          by TheRaven64 ( 641858 ) on Sunday January 08, 2012 @02:42PM (#38631236) Journal
          Or, for those more interested in computers, sudoku has quite a few things in common with a number of error correction techniques and some compression algorithms. This particular result is moderately interesting from an information theoretic perspective and is probably a fairly minor part of a larger project that may well yield practical results.
        • by Creepy ( 93888 ) on Monday January 09, 2012 @02:08PM (#38640338) Journal

          Like many things, you can always put a lot of negative spin on it and make it sound like the dumbest thing in the world. I got sent an article about "shrimp on a treadmill" that probably came from a Fox News writer - it was neither objective nor balanced, ignoring even mentioning the purpose of the study to hype what it called government waste. Without any objective information about what the goals of the study were or what the researchers were actually studying (it was boiled down to "pollutants"), it is very hard to make an informed decision about whether the study was merit-able.

          The liberals are no better - I got sent a "99% rally" email from someone likely in the 1%, but not a millionaire - I sent back that the top 1.5% starts at $250k - you probably ARE the top 1% (I know she and her husband make about $400k since my brother and her husband are business partners). To that she replied OMG, I didn't know that!

          I do have some very liberal friends that are usually objective, but we disagree on certain points. Only my moderate conservative friends are objective - the very conservative ones are frustrating. One of them was arguing that every citizen should pay at least $1 tax every year, and I was saying that's crazy - why should retired people and people that live in the street and have no money at all have to pay tax? He said "they use public streets and parks, they should pay tax - no exceptions." It is this "no exceptions" Republican mentality that makes me want to use a baseball bat on their heads - that is the absolute WORST reason I've ever heard of for taxation - we should take money from the people that don't have any just because they live here...

      • Re:Cue the morons. (Score:5, Insightful)

        by doshell ( 757915 ) on Sunday January 08, 2012 @03:20PM (#38631480)

        In the seventeenth century, Pierre de Fermat and Blaise Pascal spent quite a good time reasoning about "fucking brain teasers". The eventual outcome of this work was the theory of probabilities, without which much of today's knowledge in engineering, economics, biology and countless other fields would be pretty much impossible.

        Also around the seventeenth century, other people who were also fond of "fucking brain teasers" wondered what could happen if one assumed some numerical quantity to exist whose square was -1. The eventual outcome was the theory of complex numbers, without which, arguably, modern quantum mechanics would never have been developed. Quantum mechanics itself, at the time of its discovery in the early twentieth century, was pretty much useless in practical terms; but modern electronics would have been impossible without it.

        One could also mention the whole plethora of "fucking brain teasers" that led to the discovery of group theory, a branch of mathematics dating to the late nineteenth century. Without it, modern cryptography would not exist at all.

        These stories are meant to illustrate that your ignorant comment fails to recognize the potential long-term consequences of discoveries that have no short-term practical outcome. And that's assuming practical outcomes are all that matter; in past times we used to think that "knowledge for knowledge's sake" was a motto to live by. People who think like you (and there are unfortunately a lot of them in positions where they can influence public policy) are ultimately setting back the scientific and technological progress of mankind.

      • by rmstar ( 114746 ) on Sunday January 08, 2012 @03:40PM (#38631602)

        yes this money was well spent to figure out one of man's most complex problems ... a fucking brain teaser

        Just so you know, I have no problem with that and in fact I think this is a good way of spending money. I think this is money well spend, and I find it good that the state spends money on this.

    • Socialism (Score:5, Funny)

      by Anonymous Coward on Sunday January 08, 2012 @02:50PM (#38631270)

      There are only two reasons to spend taxpayer money: To defend America, and to get Republicans back into power!

      Everything else is SOCIALISM!

    • by DNS-and-BIND ( 461968 ) on Sunday January 08, 2012 @02:53PM (#38631286) Homepage
      I see we already have one ignoramus calling others idiots for daring to dissent with the prevailing narrative.

      It's not about whining about tax money. It's about ensuring that the tax money that we DO spend, is spent wisely. All too often, this does not occur. As an educated person, surely you are aware of wasteful government spending. Heck, anytime the Pentagon gets its hands on taxpayer money, it's wasteful spending, eh? So there's something you can relate to.

      Calling dissenters ignorant is just shilling for the mainstream narrative. "If you don't agree with my political points, you must be stupid. There is no other possible explanation for your disagreement with what me and all my friends agree to be totally obvious."

    • by Anonymous Coward on Sunday January 08, 2012 @04:01PM (#38631772)

      We all know they are morons. But I'm sure you will agree with me, that calling them that will never ever in all of time and space of all of the universe make them go "Oh, you're so right, I am such an idiot. I must go smite myself to death right now for being so disgusting!". Right? :D
      No, it will only make them angry at you (the reason/logic of this is not the point), worsening the situation. (Don't believe me? That's OK. You should never just believe. Ask him how he feels. ^^)

      I found the best way to handle an idiot, is very counter-intuitive: You have to treat him seriously, be polite, and truly understand him. (Unless that is too much work. But then, don't bother and walk away, since all other options will only make it worse. Something that is certainly not in your interest, is it?)

      If you do that, you will know that from their pov, with their experiences and thoughts, their view by definition makes sense. But you know it doesn't. And you know why. So you see the holes in their information and thoughts, and can, in (their) character, ask those questions.
      The beauty of asking it as questions, is that 1. the idiot does the work, while you can relax and poke at the holes, and 2. if he finds his former opinion to be wrong, it will be *him* who found it out. So he can keep his pride. Which is key to him accepting the whole thing.
      This results in a very strong supporter of the newly found knowledge, and perhaps even a friend. You don't need to push it into him. It will be part of him from the beginning.

      Does that sound better than getting all angry, being called a dick, and making things worse? :)
      (Yeah, I know, I'm having trouble doing it right now, and not falling into total rage about you. Forgive me that, and may he forgive you. But: Was it worth it? What do you think? :D)

      Now about the "What's the point?" question: What if you looked at it like a valid question? That doesn't sound that far-fetched, does it? Can you yourself give a valid answer to that question? Yes? Why didn't you do that then? Was there a reason not to? What do you think happens, when somebody constantly gets reactions like your comment, and is a moron? Does it sound like something good?

      See...

  • by Anonymous Coward on Sunday January 08, 2012 @02:08PM (#38631024)

    I have a question which is somewhat related here and about which I have always wondered:

    How much of a sudoku, once filled in, must be "checked" in order to be certain that the whole thing is correct?

    • by kaismh ( 2548408 ) on Sunday January 08, 2012 @02:13PM (#38631066)
      I guess all of it, if there was no assumptions or preliminary check
    • by tempest69 ( 572798 ) on Sunday January 08, 2012 @02:30PM (#38631184) Journal
      Your question needs clarification

      Are we assuming that there was no sort of error checking on the input to begin with?
      so can someone place 2 9's in the same row, column or square?
      if so you need to check all the non clue squares.(now max of 64)
      the proof is simple, take any checking scheme you like, and change the last number checked of a valid sudoku.

      If we do have input validation and a full Sudoku we know it's right.
    • by maxwell demon ( 590494 ) on Sunday January 08, 2012 @04:03PM (#38631794) Journal

      If you have checked all sub squares, and go on to check the rows and columns, you can omit every third row and column. That's because by checking the squares, you've already made sure that three consecutive squares (which contain the same fields as three consecutive lines) contain each digit three times, and by checking the first two lines you've checked that two of those are in those lines, therefore you already know that the third line contains the third occurrence of each digit, i.e. each digit exactly once, and analogously for the columns.

      Also note that when checking a sub square, line or column, you only have to check that every digit occurs; if so, then you already know that each occurs exactly once.

  • Difficulty (Score:5, Interesting)

    by Dan East ( 318230 ) on Sunday January 08, 2012 @02:09PM (#38631028) Journal

    Most newspaper puzzles have around 25 clues, with the difficulty of the puzzle decreasing as more clues are given.

    That's not necessarily true. The difficulty is really determined by the algorithms required to solve the puzzle. For example, X-Wing, Swordfish, chaining, etc, are all advanced techniques. Those are really only used when they have to be - no simpler methods remain to identify a correct play. It can become very tedious poring over the pencil marks trying to identify which algorithms can be exploited, and therein lies the difficulty. Even if a puzzle has a lot of clues, if the gameplay hinges on the use of a single advanced algorithm along the way then the puzzle would be advanced.

    Personally, I like to play at easier levels for pure speed, with a good time being well under 60 seconds.

    • by DavidTC ( 10147 ) <{moc.xobreven} { ... .vidavsxd54sals}> on Sunday January 08, 2012 @02:51PM (#38631276) Homepage

      Yeah, I was baffled as to when we started solving Sudoku by 'brute force'. That would be incredibly time consuming.

      And if that was how people solved Sudoku, adding a few more blank cells would not actually make them much harder. (Assuming some sort of moderately intelligent brute force that was not literally trying every possible combination...people would hopefully be smart enough to abort each attempt as soon as a conflict arose.)

      It's nice to know that you cannot have a Sudoku puzzle with 16 or less clues, but it is entirely possible to have, for example, a 17 clue puzzle that is, in fact, unsolvable except via computer, or via actual brute force, is not really a plausible solution for most people.

      • Re:Difficulty (Score:4, Interesting)

        by The Askylist ( 2488908 ) on Sunday January 08, 2012 @03:25PM (#38631512)

        It's not the solving of the sudoku grid that is being done by "brute force" here, but the enumeration of possible solvable puzzles and the proof that no unique solutions exist for 16 clue puzzles.

        It's actually quite instructive to write a sudoku solver - I did so myself a few years back when I decided to learn Python and needed a problem to work on.

        There's a little more finesse involved than brute force ;-)

  • by wrencherd ( 865833 ) on Sunday January 08, 2012 @02:10PM (#38631042)
    Sorry for the double-post, but I got signed out somehow:

    I have a question which is somewhat related here and about which I have always wondered:

    How much of a sudoku, once filled in, must be "checked" in order to be certain that the whole thing is correct?
  • I prefer... (Score:4, Funny)

    by wbr1 ( 2538558 ) on Sunday January 08, 2012 @02:11PM (#38631054)
    I prefer Sudoku puzzles with only one clue. That way I can finish them any damn way I want. Multiple solutions are my friend.
    Besides, I am a word geek, not a math geek. Cruciverbalism is my cup of tea (or letters).
  • by KingAlanI ( 1270538 ) on Sunday January 08, 2012 @02:23PM (#38631142) Homepage Journal

    Reading TFA (I know, I know)...

    look at a completed Sudoku puzzle and figure out the the minimum clues needed to make the puzzle solvable in one particular way.

    17-clue puzzles have been observed (although not all the time). 16-clue puzzles haven't, and he came up with theoretical backing for that. Science!

    brute-forcing would take too long, so they modified a piece of open source software to check possibilities in less time. (they still had to use a supercomputer)
    they can eliminate setups that are identical for the purposes of this analysis.

    The "Hitting Set Problem" isn't just an issue in Sudoku

  • 300,000 years (Score:2, Insightful)

    by Anonymous Coward on Sunday January 08, 2012 @02:24PM (#38631150)

    From the paper: ". . . the paper estimates that our original version would take over 300,000 years on
    one computer to finish this project."

    Assuming Moore's law continues, it would take about 28 years, but you would have to wait 27 years to buy the computer.

  • by Anonymous Coward on Sunday January 08, 2012 @02:45PM (#38631242)

    16 clues will always generate puzzles with multiple solutions.
    Does this also mean that any puzzle with 17 clues has exactly one solution?

    • Re:What about... (Score:5, Informative)

      by The Askylist ( 2488908 ) on Sunday January 08, 2012 @03:15PM (#38631440)

      No - there exist multiple solutions for up to 77 clues (81 -4), where a particular configuration of numbers exists:

      1 x x 2 x x x x x
      2 x x 1 x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      ...

      or

      2 x x 1 x x x x x
      1 x x 2 x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      x x x x x x x x x
      ...

      (where the x's are the same in each configuration) are two distinct solutions, but the 77 x's are the same clues.

      (Sorry - couldn't be bothered to fill the x's in!)

  • by KingAlanI ( 1270538 ) on Sunday January 08, 2012 @02:48PM (#38631256) Homepage Journal

    This puzzle has only 17, but that's enough clues for me...

  • by NEDHead ( 1651195 ) on Sunday January 08, 2012 @02:49PM (#38631266)

    Assuming he had access to 5 supercomputers, this would suggest he ran the program continuously for at least 45+ years. Dedication!

  • by dmomo ( 256005 ) on Sunday January 08, 2012 @03:14PM (#38631428)

    That ought to be enough for anyone.

  • by byteherder ( 722785 ) on Sunday January 08, 2012 @03:15PM (#38631438)
    I have always wondered how many starting Soduko puzzles there are that have a unique solution.
    • by SleazyRidr ( 1563649 ) on Monday January 09, 2012 @11:08AM (#38638044)

      I got to trying to work that one out for myself a little while ago. I couldn't solve it on my own so I went to the internet for assistance. The solution I found multiplied by some huge prime number at the end, and I could never work out why, so I've shelved that problem for a little while...

  • by Anonymous Coward on Sunday January 08, 2012 @03:24PM (#38631506)

    The minimum number of clues for the solution to be complete != the minimum number of clues to solve the puzzle.

    Proof: I give you 0 clues

    Then any valid solution to any puzzle of the same dimensions as my puzzle is a valid solution to my puzzle.

    QED

  • by Anonymous Coward on Sunday January 08, 2012 @03:49PM (#38631674)

    So difficulty is only greater when there are the fewest given numbers and a unique solution. I always wondered why the ones that were mostly filled in seemed just as easy as the ones with almost none. Perhaps the ones I was doing had less than 17 and thus, no unique solution, making them easier in a way?

    Now, could we perhaps put that supercomputer back to computing something relevant to widespread disease, world hunger, or solving the global stupidity+laziness=global warming problem?

  • by Frans Faase ( 648933 ) on Sunday January 08, 2012 @04:10PM (#38631832) Homepage
    Sudoku's, like so much other puzzles, are basically equivalent with solving Exact Cover problems. There are two types of Exact Cover problems that have a unique solution, those that can be solved with simple elimination and those that cannot. Simple elimination means that you take two columns in the Exact Cover problem and see if there is an implication. If this is the case, the rows that have only one 1 in the two columns involved, can be removed and the two columns can be joined. This simple elimination rule proves to be quite powerful to solve Exact Cover problems with a unique solution. It is rather difficult to construct a Exact Cover problem with a single solution that cannot be solved with this elimination rule. But I guess with so less clues that there might be many Sudoku's that cannot be solved with simple logic implication, but do require some form of guessing.
    • by pacc ( 163090 ) on Sunday January 08, 2012 @04:21PM (#38631928) Homepage

      What is simple guessing?
      Maybe the author of this paper should use his supercomputer to find the soduko for the following rules:

      * the are at least two possible solutions from the information given in the first clues

      * following one of the incorrect clues will not be proved incorrect until the last five figures is about to be filled in.

      I ran up on hard sudokus where I had to 'guess' or follow through a faulty solution for 20 steps until it proved itself wrong.
      I think this is the trademark for a hard solution if the correct solution would lead to another choice situation after just one or two steps.

  • Is this a hard-and-firm limit? The article implies that 16 is a hard limit. 16 or fewer clues GUARANTEES multiple possible solutions, and 17 or greater GUARANTEES only one possible solution.

    Yet other commenters here show that puzzles with far more than 17 clues can have multiple possible solutions. So does this mean 16 is a hard "low" limit? That there is not one single 16-clue puzzle possible that only has one possible solution?

  • by JimboTheProgrammer ( 1756970 ) on Sunday January 08, 2012 @10:46PM (#38634422)
    So lame. This guy sends supercomputers into years of churning to find the hardest puzzle, and he doesn't give it up? C'mon man.
  • by dr_blurb ( 676176 ) on Monday January 09, 2012 @04:05AM (#38635696)

    Now the mathematicians are done with Sudoku, start working on Calcudoku (which is like killer Sudoku, but with more operators and no restriction on puzzle size):

    • how many different puzzles are possible, given a certain puzzle size and a distribution of cage sizes?
    • how to deterministically create a puzzle with a unique solution?
    • how to compute a measure of the difficulty level of a puzzle?
    • how many (and which) clues are needed for a "single path" solution?
    • ...

    For example puzzles, see online Calcudoku puzzles [calcudoku.org].

  • by __aaxkpi2210 ( 2426926 ) on Monday January 09, 2012 @04:15PM (#38642178)
    Once again, the number 17 appears.

The most delightful day after the one on which you buy a cottage in the country is the one on which you resell it. -- J. Brecheux

Working...