<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/1.5.2" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: An early crop of Sudoku</title>
	<link>http://bit-player.org/2006/a-new-crop-of-sudoku</link>
	<description>An amateur's outlook on computation and mathematics.</description>
	<pubDate>Fri, 29 Aug 2008 05:10:46 +0000</pubDate>
	<generator>http://wordpress.org/?v=1.5.2</generator>

	<item>
 		<title>Comment on An early crop of Sudoku by: Rijk Willemse</title>
		<link>http://bit-player.org/2006/a-new-crop-of-sudoku#comment-56</link>
		<pubDate>Fri, 07 Apr 2006 11:30:37 +0000</pubDate>
		<guid>http://bit-player.org/2006/a-new-crop-of-sudoku#comment-56</guid>
					<description>I am addicted to Sudoku! I made an inventory of methods for solving even the most difficult Sudoku. Start with looking for duo's, it's an eye opener!
Check http://www.sudokuhints.nl/en/ for details.

Good luck!</description>
		<content:encoded><![CDATA[	<p>I am addicted to Sudoku! I made an inventory of methods for solving even the most difficult Sudoku. Start with looking for duo&#8217;s, it&#8217;s an eye opener!<br />
Check <a href='http://www.sudokuhints.nl/en/' rel='nofollow'>http://www.sudokuhints.nl/en/</a> for details.</p>
	<p>Good luck!
</p>
]]></content:encoded>
				</item>
	<item>
 		<title>Comment on An early crop of Sudoku by: Barry Cipra</title>
		<link>http://bit-player.org/2006/a-new-crop-of-sudoku#comment-44</link>
		<pubDate>Mon, 27 Mar 2006 19:29:44 +0000</pubDate>
		<guid>http://bit-player.org/2006/a-new-crop-of-sudoku#comment-44</guid>
					<description>Behrens's 5x5 array might be a nice place to study the problem of minimal clues.  It was easy to reduce your mini-pseudoku to one with just 6 clues:

&lt;code&gt;
 - 2 - - -
 4 - 1 - 3
 - - - 5 -
 - - - - -
 3 - - - -
&lt;/code&gt;
A little more work gets rid of the 5, still leaving a uniquely solvable mini-pseudoku:

&lt;code&gt;
 - 2 - - -
 4 - 1 - 3
 - - - - -
 - - - - -
 3 - - - -
&lt;/code&gt;
Can anyone find one with fewer clues?  (It clearly requires at least 4 clues, otherwise at least two numbers would be ambiguous.)</description>
		<content:encoded><![CDATA[	<p>Behrens&#8217;s 5&#215;5 array might be a nice place to study the problem of minimal clues.  It was easy to reduce your mini-pseudoku to one with just 6 clues:</p>
	<p><code><br />
 - 2 - - -<br />
 4 - 1 - 3<br />
 - - - 5 -<br />
 - - - - -<br />
 3 - - - -<br />
</code><br />
A little more work gets rid of the 5, still leaving a uniquely solvable mini-pseudoku:</p>
	<p><code><br />
 - 2 - - -<br />
 4 - 1 - 3<br />
 - - - - -<br />
 - - - - -<br />
 3 - - - -<br />
</code><br />
Can anyone find one with fewer clues?  (It clearly requires at least 4 clues, otherwise at least two numbers would be ambiguous.)
</p>
]]></content:encoded>
				</item>
</channel>
</rss>
