<?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: Wrap-around Consecutive Samurai Star</title>
	<atom:link href="http://www.garethmoore.co.uk/2009/07/wrap-around-consecutive-samurai-star/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.garethmoore.co.uk/2009/07/wrap-around-consecutive-samurai-star/</link>
	<description>Puzzle and brain-training author</description>
	<lastBuildDate>Sun, 10 Mar 2013 11:39:58 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Christine</title>
		<link>http://www.garethmoore.co.uk/2009/07/wrap-around-consecutive-samurai-star/comment-page-1/#comment-245</link>
		<dc:creator>Christine</dc:creator>
		<pubDate>Wed, 08 Jul 2009 19:29:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.garethmoore.co.uk/?p=488#comment-245</guid>
		<description>This was a great puzzle - just the right degree of difficulty for me - challenging but manageable.  As you probably know by now, I don&#039;t do the sudoku solving jargon (I&#039;ve never got to grips with it, though I&#039;m sure I use some of the strategies without realising it).  Just to say that once started I managed this without too much difficulty.  Like Spittledung I started with the lower centre box, and then looked at the very long line of consecutive numbers in the middle, and with some thought the puzzle seemed to fall into place. It took me about an hour to complete.

Now to get back to the 12 x 12 one - I&#039;m not getting anywhere fast with that.  I may be asking for a few hints soon!</description>
		<content:encoded><![CDATA[<p>This was a great puzzle &#8211; just the right degree of difficulty for me &#8211; challenging but manageable.  As you probably know by now, I don&#8217;t do the sudoku solving jargon (I&#8217;ve never got to grips with it, though I&#8217;m sure I use some of the strategies without realising it).  Just to say that once started I managed this without too much difficulty.  Like Spittledung I started with the lower centre box, and then looked at the very long line of consecutive numbers in the middle, and with some thought the puzzle seemed to fall into place. It took me about an hour to complete.</p>
<p>Now to get back to the 12 x 12 one &#8211; I&#8217;m not getting anywhere fast with that.  I may be asking for a few hints soon!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gareth Moore</title>
		<link>http://www.garethmoore.co.uk/2009/07/wrap-around-consecutive-samurai-star/comment-page-1/#comment-243</link>
		<dc:creator>Gareth Moore</dc:creator>
		<pubDate>Wed, 08 Jul 2009 17:07:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.garethmoore.co.uk/?p=488#comment-243</guid>
		<description>Ah, now that&#039;s a good point - I&#039;d overlooked that!  I ran my sudoku analysis software on it but it doesn&#039;t look at multiple groupings of consecutive markers in the same region, considering only any chosen pair at once.  If you &lt;em&gt;don&#039;t&lt;/em&gt; look at region cooccurrences then you need a hidden quad towards the end, but of course any human solver would make the more intuitive deduction instead.  :)
&lt;p&gt;
You can see a similar issue in Futoshiki if a computer solver considers only pairs (the obvious way to implement).  If a&gt;b&lt;c in a single row/column then in (say) a 5x5 grid clearly b cannot be 4, but if you consider only pairs then the only deduction the computer will make is that b is not 5 (without any other information at any rate).  Whilst it&#039;s not hard to make a machine more intelligent (it can easily run an exhaustive search) the problem soon becomes that you make puzzles that are far too hard - so I&#039;ve always thought it better to err on the side of too easy than too hard! :)  Of course, if you have the time and inclination then the best solution of all is to make explicit implementations of all the things you find yourself doing as a human solver - then you can be sure it&#039;s fair &lt;em&gt;and&lt;/em&gt; tricky! :)</description>
		<content:encoded><![CDATA[<p>Ah, now that&#8217;s a good point &#8211; I&#8217;d overlooked that!  I ran my sudoku analysis software on it but it doesn&#8217;t look at multiple groupings of consecutive markers in the same region, considering only any chosen pair at once.  If you <em>don&#8217;t</em> look at region cooccurrences then you need a hidden quad towards the end, but of course any human solver would make the more intuitive deduction instead.  <img src='http://www.garethmoore.co.uk/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>
You can see a similar issue in Futoshiki if a computer solver considers only pairs (the obvious way to implement).  If a&gt;b&lt;c in a single row/column then in (say) a 5&#215;5 grid clearly b cannot be 4, but if you consider only pairs then the only deduction the computer will make is that b is not 5 (without any other information at any rate).  Whilst it&#8217;s not hard to make a machine more intelligent (it can easily run an exhaustive search) the problem soon becomes that you make puzzles that are far too hard &#8211; so I&#8217;ve always thought it better to err on the side of too easy than too hard! <img src='http://www.garethmoore.co.uk/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />   Of course, if you have the time and inclination then the best solution of all is to make explicit implementations of all the things you find yourself doing as a human solver &#8211; then you can be sure it&#8217;s fair <em>and</em> tricky! <img src='http://www.garethmoore.co.uk/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Spittledung</title>
		<link>http://www.garethmoore.co.uk/2009/07/wrap-around-consecutive-samurai-star/comment-page-1/#comment-240</link>
		<dc:creator>Spittledung</dc:creator>
		<pubDate>Tue, 07 Jul 2009 16:02:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.garethmoore.co.uk/?p=488#comment-240</guid>
		<description>Yum Yum Fun! :D

*****
SPOILER!
*****

I am not sure what nasty hidden set you were referring to. At the start of the puzzle I worked on the center box and very lower box. Then I did the conga line of consecutives in the middle right row.

Once you do this and apply the samurai flower rule diligently, the puzzle breaks down rather nicely. I think there were a few times I had triplets with a pair of consecutive numbers with no bars in the row/column ... which meant the non-consecutive number had to be in the middle square.

I enjoyed this one. Thanks.</description>
		<content:encoded><![CDATA[<p>Yum Yum Fun! <img src='http://www.garethmoore.co.uk/wp-includes/images/smilies/icon_biggrin.gif' alt=':D' class='wp-smiley' /> </p>
<p>*****<br />
SPOILER!<br />
*****</p>
<p>I am not sure what nasty hidden set you were referring to. At the start of the puzzle I worked on the center box and very lower box. Then I did the conga line of consecutives in the middle right row.</p>
<p>Once you do this and apply the samurai flower rule diligently, the puzzle breaks down rather nicely. I think there were a few times I had triplets with a pair of consecutive numbers with no bars in the row/column &#8230; which meant the non-consecutive number had to be in the middle square.</p>
<p>I enjoyed this one. Thanks.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
