<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: A Sudoku challenge generator</title>
	<atom:link href="http://blog.forret.com/2006/08/a-sudoku-challenge-generator/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/</link>
	<description>Tango, photography and whatever&#039;s bleeding edge</description>
	<lastBuildDate>Thu, 27 Oct 2011 14:28:42 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.4</generator>
	<item>
		<title>By: Generating Sudoku puzzles using JavaScript &#124; CodeUtopia</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-324639</link>
		<dc:creator>Generating Sudoku puzzles using JavaScript &#124; CodeUtopia</dc:creator>
		<pubDate>Sat, 29 Nov 2008 11:57:33 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-324639</guid>
		<description>[...] there are some examples of generating sudokus online, such as this interesting approach, it seems there&#8217;s only one &#8220;true&#8221; way: Using a backtracking [...]</description>
		<content:encoded><![CDATA[<p>[...] there are some examples of generating sudokus online, such as this interesting approach, it seems there&#8217;s only one &#8220;true&#8221; way: Using a backtracking [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pallavi</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-291874</link>
		<dc:creator>Pallavi</dc:creator>
		<pubDate>Thu, 28 Aug 2008 08:47:32 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-291874</guid>
		<description>I am sorry. I mistook Simon as the author of this blog article. My first note was to the author. 
Simon, you idea is also very good and innovative.</description>
		<content:encoded><![CDATA[<p>I am sorry. I mistook Simon as the author of this blog article. My first note was to the author.<br />
Simon, you idea is also very good and innovative.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pallavi</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-291873</link>
		<dc:creator>Pallavi</dc:creator>
		<pubDate>Thu, 28 Aug 2008 08:40:25 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-291873</guid>
		<description>Hi Simon, your article is really good. Its so simple and crisp, yet so complete. Thank you so much for sharing this article.</description>
		<content:encoded><![CDATA[<p>Hi Simon, your article is really good. Its so simple and crisp, yet so complete. Thank you so much for sharing this article.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Simon Broadley</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-112964</link>
		<dc:creator>Simon Broadley</dc:creator>
		<pubDate>Tue, 03 Jul 2007 16:11:40 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-112964</guid>
		<description>This will always produce variations on a theme - three numbers which start off adjacent will remain adjacent - though in a different order. 

If anyone fancies a look, I&#039;ve used an entirely different approach in my Javascript sudoku generator:

http://www.picturesudoku.com

In essence, it fills in as much as it can, and then solves the puzzle to get the remaining numbers.

Best Wishes,
Simon</description>
		<content:encoded><![CDATA[<p>This will always produce variations on a theme &#8211; three numbers which start off adjacent will remain adjacent &#8211; though in a different order. </p>
<p>If anyone fancies a look, I&#8217;ve used an entirely different approach in my Javascript sudoku generator:</p>
<p><a href="http://www.picturesudoku.com" rel="nofollow">http://www.picturesudoku.com</a></p>
<p>In essence, it fills in as much as it can, and then solves the puzzle to get the remaining numbers.</p>
<p>Best Wishes,<br />
Simon</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Artuzai</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-96750</link>
		<dc:creator>Artuzai</dc:creator>
		<pubDate>Sun, 20 May 2007 05:46:04 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-96750</guid>
		<description>This article inspired me to write a Sudoku generator in PHP. Thanks for the good ground-work! However I am finding that even with 6 Mutation rules (Row Swap, Col Swap, Row Block Swap, Col Block Swap, Transpose and Replace) and 100 mutations that the mutated grid shows some patterns. Groups of 3 (either row or column) within one block will always reoccur in the same position in the other blocks. Say, in position 1,1 (top left) we had the numbers 4,7,1 then we also get exactly that set of numbers in the 2nd row (or 3rd row) of the top middle block (in perhaps different sequence) and the same set of numbers also in the 3rd row (or 2nd row) of the top right block. Surely a good mutation sequence would not have necessarily the same set of numbers together :-)

http://www.tobiasw.net/Misc/JavaScript/Sudoku2/SudokuX.php</description>
		<content:encoded><![CDATA[<p>This article inspired me to write a Sudoku generator in PHP. Thanks for the good ground-work! However I am finding that even with 6 Mutation rules (Row Swap, Col Swap, Row Block Swap, Col Block Swap, Transpose and Replace) and 100 mutations that the mutated grid shows some patterns. Groups of 3 (either row or column) within one block will always reoccur in the same position in the other blocks. Say, in position 1,1 (top left) we had the numbers 4,7,1 then we also get exactly that set of numbers in the 2nd row (or 3rd row) of the top middle block (in perhaps different sequence) and the same set of numbers also in the 3rd row (or 2nd row) of the top right block. Surely a good mutation sequence would not have necessarily the same set of numbers together <img src='http://blog.forret.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
<p><a href="http://www.tobiasw.net/Misc/JavaScript/Sudoku2/SudokuX.php" rel="nofollow">http://www.tobiasw.net/Misc/JavaScript/Sudoku2/SudokuX.php</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: scott</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-95187</link>
		<dc:creator>scott</dc:creator>
		<pubDate>Mon, 14 May 2007 14:27:36 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-95187</guid>
		<description>in addition to methods of swapping rows/columns to generate puzzles, you should also be able to swap individual numbers globally.  for example, replace every 7 with a 5, and replace every 5 with a 7.</description>
		<content:encoded><![CDATA[<p>in addition to methods of swapping rows/columns to generate puzzles, you should also be able to swap individual numbers globally.  for example, replace every 7 with a 5, and replace every 5 with a 7.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xiangyu Cao</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-95053</link>
		<dc:creator>Xiangyu Cao</dc:creator>
		<pubDate>Mon, 14 May 2007 02:09:34 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-95053</guid>
		<description>Acctually, I think swap rows and columns can implement transposing already.</description>
		<content:encoded><![CDATA[<p>Acctually, I think swap rows and columns can implement transposing already.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xiangyu Cao</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-95046</link>
		<dc:creator>Xiangyu Cao</dc:creator>
		<pubDate>Mon, 14 May 2007 01:45:41 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-95046</guid>
		<description>Cool. Just wondering if step 2 can produce all possible puzzles? If not, what&#039;s the percentage?

Actually, I think it should be able to produce all possible puzzles.</description>
		<content:encoded><![CDATA[<p>Cool. Just wondering if step 2 can produce all possible puzzles? If not, what&#8217;s the percentage?</p>
<p>Actually, I think it should be able to produce all possible puzzles.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: prasad</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-43759</link>
		<dc:creator>prasad</dc:creator>
		<pubDate>Wed, 31 Jan 2007 13:45:17 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-43759</guid>
		<description>enjoyed reading ur article but i have a different algorithm to generate a valid filled sudokus not restricting your shuffling to rows and coloumns..and one more whats that symmetry in sudoku all about...</description>
		<content:encoded><![CDATA[<p>enjoyed reading ur article but i have a different algorithm to generate a valid filled sudokus not restricting your shuffling to rows and coloumns..and one more whats that symmetry in sudoku all about&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jovivebo</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-37754</link>
		<dc:creator>jovivebo</dc:creator>
		<pubDate>Thu, 18 Jan 2007 20:15:41 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-37754</guid>
		<description>I recently read an article about sudoku in the newspaper.  From a mathematical point of view it seemed a lot more complicated than I had expected.  It is eg. still unknown to mathematicians how many sudoku challenges there are.  Remember here that a true soduku has one and only one solution as mentioned above !  The article mentioned that there was one mathematician who though that you could have a sudoku with 16 remaining cells and a unique solution.  It remains to be proven though.  I believe the best any mathematician had done so far was discover a soduko with 17 remaining cells and only two solutions.</description>
		<content:encoded><![CDATA[<p>I recently read an article about sudoku in the newspaper.  From a mathematical point of view it seemed a lot more complicated than I had expected.  It is eg. still unknown to mathematicians how many sudoku challenges there are.  Remember here that a true soduku has one and only one solution as mentioned above !  The article mentioned that there was one mathematician who though that you could have a sudoku with 16 remaining cells and a unique solution.  It remains to be proven though.  I believe the best any mathematician had done so far was discover a soduko with 17 remaining cells and only two solutions.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ellie</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-36506</link>
		<dc:creator>Ellie</dc:creator>
		<pubDate>Mon, 15 Jan 2007 16:37:25 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-36506</guid>
		<description>I have implemented an excel macro for this algorithm.  Although my removal method is a little different.  The problem with step 2 is that it allows for a repeating pattern with respect to column for each sub grid, as can be seen from your example &#039;2 5 8&#039;, &#039;3 6 9&#039;, &#039;1 4 7&#039; will always be in the same column for each sub grid.  I am still looking for an algorith to break that.</description>
		<content:encoded><![CDATA[<p>I have implemented an excel macro for this algorithm.  Although my removal method is a little different.  The problem with step 2 is that it allows for a repeating pattern with respect to column for each sub grid, as can be seen from your example &#8217;2 5 8&#8242;, &#8217;3 6 9&#8242;, &#8217;1 4 7&#8242; will always be in the same column for each sub grid.  I am still looking for an algorith to break that.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: joshua</title>
		<link>http://blog.forret.com/2006/08/a-sudoku-challenge-generator/comment-page-1/#comment-31565</link>
		<dc:creator>joshua</dc:creator>
		<pubDate>Thu, 04 Jan 2007 14:42:19 +0000</pubDate>
		<guid isPermaLink="false">http://blog.forret.com/2006/08/a-sudoku-challenge-generator/#comment-31565</guid>
		<description>can I use the algorithm in my project?</description>
		<content:encoded><![CDATA[<p>can I use the algorithm in my project?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.542 seconds -->

