<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0">
  <channel>
    <title>'Magic squares' Thread RSS Feed</title>
    <link>http://www.programmersheaven.com/</link>
    <description>Contains the latest posts from the thread 'Magic squares' posted on the 'Algorithms' forum at Programmer's Heaven.</description>
    <language>en</language>
    <copyright>Copyright 2013 Programmers Heaven</copyright>
    <pubDate>Tue, 18 Jun 2013 17:53:42 -0700</pubDate>
    <lastBuildDate>Tue, 18 Jun 2013 17:53:42 -0700</lastBuildDate>
    <generator>Argotic Syndication Framework 2007.3.0.1, http://www.codeplex.com/Argotic</generator>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <ttl>360</ttl>
    <image>
      <url>http://www.programmersheaven.com/images/ph.gif</url>
      <title>Programmers Heaven</title>
      <link>http://www.programmersheaven.com/</link>
      <width>88</width>
      <height>31</height>
    </image>
    <item>
      <title>Magic squares</title>
      <link>http://www.programmersheaven.com/mb/Algorithms/109093/109093/magic-squares/</link>
      <description>Hi!&lt;br /&gt;
I'm interested in generating a sort of magic square (or rather - magic cube), when all (or some) sums are known and also some numbers to put in are known.&lt;br /&gt;
E.g. create a square, where sums at each column are: 15,18,22,14,19 (from left to right), and numbers in square range from 3 to 8 (each number can appear more than once).&lt;br /&gt;
&lt;br /&gt;
I'd be grateful for any help.&lt;br /&gt;
&lt;br /&gt;
Thanks,&lt;br /&gt;
Sorrow.&lt;br /&gt;</description>
      <guid isPermaLink="true">http://www.programmersheaven.com/mb/Algorithms/109093/109093/magic-squares/</guid>
      <pubDate>Wed, 03 Apr 2002 03:28:53 -0700</pubDate>
      <category>Algorithms</category>
    </item>
    <item>
      <title>Re: Magic squares</title>
      <link>http://www.programmersheaven.com/mb/Algorithms/109093/109640/re-magic-squares/#109640</link>
      <description>You would really have to know a little more than that to solve it. But here's how to generate the appropriate algorithm: think of how you would do it on your own.&lt;br /&gt;
&lt;br /&gt;
In each square, assume that the value is approximately 1/4 of the sum, for a 4X4 square. Then, create the rest of the first colomn using that method. Now work across from the top row, but now each square takes 1/3 of the sum after you've subtracted what you already know. Then you work down again. When you find that you don't have enough numbers to play with, adjust 1 of the numbers set previously, and try again, until you reach the bottom right corner. If you did it right, then the sum of the diagonals should equal the number printed in the bottom corner.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Your most important program will require more memory and processing power than you have.&lt;br /&gt;
&lt;br /&gt;</description>
      <guid isPermaLink="true">http://www.programmersheaven.com/mb/Algorithms/109093/109640/re-magic-squares/#109640</guid>
      <pubDate>Fri, 05 Apr 2002 07:20:27 -0700</pubDate>
      <category>Algorithms</category>
    </item>
  </channel>
</rss>