Comments on: The Sudoku Challenge http://www.antonnguyen.com/2009/03/24/the-sudoku-challenge/ A Geek To The nth Degree Fri, 13 May 2011 01:00:24 -0700 http://wordpress.org/?v=2.8.4 hourly 1 By: Marc http://www.antonnguyen.com/2009/03/24/the-sudoku-challenge/comment-page-1/#comment-551 Marc Fri, 10 Apr 2009 22:34:23 +0000 http://www.antonnguyen.com/?p=219#comment-551 Hi Anton, I just read the AMS paper and my eyes went crossed in trying to decipher the equation for determining what preemptive sets are in a sudoku puzzle. I came across your blog post while googling for "preemptive sets" in trying to get a simpler definition and was surprised to see your translation. That's exactly how I would solve these puzzles too! Surely this article isn't merely placing an equation over this widely known method? It seems that (although I've yet to discover) Crook's algorithm allows you to whittle down stuck moments where a simple process of elimination method (singles, intersecting numbers, etc) would not work. Is this true? Oh I also liked your link to NP-Complete problems; very informative! Hi Anton,

I just read the AMS paper and my eyes went crossed in trying to decipher the equation for determining what preemptive sets are in a sudoku puzzle. I came across your blog post while googling for “preemptive sets” in trying to get a simpler definition and was surprised to see your translation. That’s exactly how I would solve these puzzles too! Surely this article isn’t merely placing an equation over this widely known method?

It seems that (although I’ve yet to discover) Crook’s algorithm allows you to whittle down stuck moments where a simple process of elimination method (singles, intersecting numbers, etc) would not work. Is this true?

Oh I also liked your link to NP-Complete problems; very informative!

]]>