<?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: Perplex City and Magic Squares</title>
	<atom:link href="http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/feed/" rel="self" type="application/rss+xml" />
	<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/</link>
	<description>but still a permanent idiot</description>
	<lastBuildDate>Wed, 09 May 2012 20:59:50 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
	<item>
		<title>By: Rick</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-14600</link>
		<dc:creator>Rick</dc:creator>
		<pubDate>Wed, 09 May 2012 20:59:50 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-14600</guid>
		<description>There was a third solution you didnt identify... that I did for 4x4.. .each equaling 34</description>
		<content:encoded><![CDATA[<p>There was a third solution you didnt identify&#8230; that I did for 4&#215;4.. .each equaling 34</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Cowan</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-13458</link>
		<dc:creator>Chris Cowan</dc:creator>
		<pubDate>Mon, 23 Apr 2012 12:26:42 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-13458</guid>
		<description>i found a one that you have listed as unsovibaule 3 17 16
                                                                               14     9  11
                                                                               10 12    7
                                                                                    5  4  18</description>
		<content:encoded><![CDATA[<p>i found a one that you have listed as unsovibaule 3 17 16<br />
                                                                               14     9  11<br />
                                                                               10 12    7<br />
                                                                                    5  4  18</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tim Dunn</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-13279</link>
		<dc:creator>Tim Dunn</dc:creator>
		<pubDate>Fri, 20 Apr 2012 22:08:53 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-13279</guid>
		<description>Hi there,
Interesting stuff. I wrote an Excel spreadsheet that finds a solution to 4x4 (not always the same solution)
It uses an evolutionary approach. Start with random arrangement. Generate 10 offspring by swapping two random locations. Calculate the &#039;goodness&#039; of each offspring (sum of differences in all row col diag sums). Use the best offspring as the parent for the next generation. I find that it get a solution in less than 100 generations if it ever gets one. Sometimes it gets stuck in local minima from which there is no escape. To get round this I simply set a limit (150) on generations before reverting to the original arrangement and re-starting.
One interesting thing is that it was not told that the total had to be 34, only that all the totals had to match.
Obviously it would be saner to code it in C or something rather than Excel but at the time I had no access to a compiler.</description>
		<content:encoded><![CDATA[<p>Hi there,<br />
Interesting stuff. I wrote an Excel spreadsheet that finds a solution to 4&#215;4 (not always the same solution)<br />
It uses an evolutionary approach. Start with random arrangement. Generate 10 offspring by swapping two random locations. Calculate the &#8216;goodness&#8217; of each offspring (sum of differences in all row col diag sums). Use the best offspring as the parent for the next generation. I find that it get a solution in less than 100 generations if it ever gets one. Sometimes it gets stuck in local minima from which there is no escape. To get round this I simply set a limit (150) on generations before reverting to the original arrangement and re-starting.<br />
One interesting thing is that it was not told that the total had to be 34, only that all the totals had to match.<br />
Obviously it would be saner to code it in C or something rather than Excel but at the time I had no access to a compiler.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Boris</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-9861</link>
		<dc:creator>Boris</dc:creator>
		<pubDate>Wed, 08 Feb 2012 17:33:24 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-9861</guid>
		<description>I am interesting only in those magic squares that to addition to sums in rows, columns and diagonales also have the same amount in all 4 quarters. One of possible solutions for that is the following one:

14 3 5 12
8 9 15 2
11 6 4 13
1 16 10 7

By the way, it was missing in your 924 solutions (giving that they all are shown in order of the first two numbers).</description>
		<content:encoded><![CDATA[<p>I am interesting only in those magic squares that to addition to sums in rows, columns and diagonales also have the same amount in all 4 quarters. One of possible solutions for that is the following one:</p>
<p>14 3 5 12<br />
8 9 15 2<br />
11 6 4 13<br />
1 16 10 7</p>
<p>By the way, it was missing in your 924 solutions (giving that they all are shown in order of the first two numbers).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Leo</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-5232</link>
		<dc:creator>Leo</dc:creator>
		<pubDate>Thu, 08 Sep 2011 02:07:19 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-5232</guid>
		<description>I found a new magic square in my homework.
1  14 8  11
15 4  10 5
12 7  13 2
6  9  3  16</description>
		<content:encoded><![CDATA[<p>I found a new magic square in my homework.<br />
1  14 8  11<br />
15 4  10 5<br />
12 7  13 2<br />
6  9  3  16</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: gm</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-3134</link>
		<dc:creator>gm</dc:creator>
		<pubDate>Sat, 14 May 2011 10:06:54 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-3134</guid>
		<description>Hey guys
Have you been able to solve any EVEN number magic squares?
eg: 6x6, 8x8, etc
There are more than one solutions as for 4x4. Please have a go.
gm</description>
		<content:encoded><![CDATA[<p>Hey guys<br />
Have you been able to solve any EVEN number magic squares?<br />
eg: 6&#215;6, 8&#215;8, etc<br />
There are more than one solutions as for 4&#215;4. Please have a go.<br />
gm</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: SÃ¸ren Blaabjerg</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-3097</link>
		<dc:creator>SÃ¸ren Blaabjerg</dc:creator>
		<pubDate>Thu, 13 Aug 2009 19:22:44 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-3097</guid>
		<description>Dear Danny

I have studied your list a bit further and found quite a number of omissions and duplicates
as well. In the end I decided to write a small computer program myself in order to find the complete list, and I have just succeeded doing so. As expected the conclusion was, that there are indeed all in all 880 unique solutions or 880 x 8 solutions if you count all rotations and reflexions. I made the program in such a way, that you can choose either and step through all the solutions displayed one by one.

Most of the solutions are not particularly interesting though. For instance I find those, where both the 2 x 2 subsquares at the corners and the subsquare at the center add up to the same sum as the rows, columns and two diagonals particularly pleasing. There are quite a number of those, around 350 unique ones I believe.</description>
		<content:encoded><![CDATA[<p>Dear Danny</p>
<p>I have studied your list a bit further and found quite a number of omissions and duplicates<br />
as well. In the end I decided to write a small computer program myself in order to find the complete list, and I have just succeeded doing so. As expected the conclusion was, that there are indeed all in all 880 unique solutions or 880 x 8 solutions if you count all rotations and reflexions. I made the program in such a way, that you can choose either and step through all the solutions displayed one by one.</p>
<p>Most of the solutions are not particularly interesting though. For instance I find those, where both the 2 x 2 subsquares at the corners and the subsquare at the center add up to the same sum as the rows, columns and two diagonals particularly pleasing. There are quite a number of those, around 350 unique ones I believe.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lawid</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-3096</link>
		<dc:creator>Lawid</dc:creator>
		<pubDate>Mon, 10 Aug 2009 11:02:54 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-3096</guid>
		<description>Hi,

I have set of 100 integers organized in 10*10 table. Only the sums of two rows are different by +1 and -1 compared to the sum required for the magic square. Can you help me in checking if we can get with these numbers a magic square table?  

Thanks</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>I have set of 100 integers organized in 10*10 table. Only the sums of two rows are different by +1 and -1 compared to the sum required for the magic square. Can you help me in checking if we can get with these numbers a magic square table?  </p>
<p>Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: SÃ¸ren Blaabjerg</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-3095</link>
		<dc:creator>SÃ¸ren Blaabjerg</dc:creator>
		<pubDate>Sat, 01 Aug 2009 10:49:18 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-3095</guid>
		<description>Dear Danny

I have just studied your list further and can confirm, that your list is far from  comprehensive and indeed also contain quite a number of duplications (i.e. solutions that can be derived through reflexion and/or rotation of other solutions on the list). I you are interested, I might myself have a look on your code :-)</description>
		<content:encoded><![CDATA[<p>Dear Danny</p>
<p>I have just studied your list further and can confirm, that your list is far from  comprehensive and indeed also contain quite a number of duplications (i.e. solutions that can be derived through reflexion and/or rotation of other solutions on the list). I you are interested, I might myself have a look on your code :-)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Danny Dawson</title>
		<link>http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/comment-page-1/#comment-3094</link>
		<dc:creator>Danny Dawson</dc:creator>
		<pubDate>Wed, 29 Jul 2009 17:05:45 +0000</pubDate>
		<guid isPermaLink="false">http://quasistoic.org/ts/archives/2006/08/13/magic-square-solver/#comment-3094</guid>
		<description>The 924 solutions I listed are indeed unique, but not rotationally or reflexively so.

Also, as several commenters have pointed out, it seems that my list is not comprehensive. I haven&#039;t taken the time yet to look back at my old code and determine why this is so, but at some point, I certainly should do so.

Thanks to all of you for your comments, and especially to SÃ¸ren for continuing to work on this puzzle. Even though I haven&#039;t done any work on this myself in a long time, it&#039;s still quite fun to think about. :)</description>
		<content:encoded><![CDATA[<p>The 924 solutions I listed are indeed unique, but not rotationally or reflexively so.</p>
<p>Also, as several commenters have pointed out, it seems that my list is not comprehensive. I haven&#8217;t taken the time yet to look back at my old code and determine why this is so, but at some point, I certainly should do so.</p>
<p>Thanks to all of you for your comments, and especially to SÃ¸ren for continuing to work on this puzzle. Even though I haven&#8217;t done any work on this myself in a long time, it&#8217;s still quite fun to think about. :)</p>
]]></content:encoded>
	</item>
</channel>
</rss>

