Hi Joel, JN> The following 3-by-3 display is a simple magic square:
JN> 0 8 4 JN> 5 1 6 JN> 7 3 2 JN> because each row and each column sums to 12. Write a function which JN> uses the integers 0 thru 8 (once each!) to construct all possible JN> 3-by-3 simple magic squares. Make it run as quickly as possible. No diagonals? I thought magic squares had to work on the diagonal as well? (not to be nit-picky or anything :) -- Gregg -- To unsubscribe from this list, just send an email to [EMAIL PROTECTED] with unsubscribe as the subject.
