Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^2: magic squares

by sflitman (Hermit)
on Apr 05, 2009 at 15:23 UTC ( #755571=note: print w/replies, xml ) Need Help??


in reply to Re: magic squares
in thread magic squares

That's what I thought. I wrote some code with Algorithm::Combinatorics and it took bloody forever so I knew it had to be wrong. I like the idea of constrained search, with all 9 entries summing to multiple of 3, but the problem is the arrangement of the PAUL letters can be anywhere in the grid, so I'm stuck searching permutations anyway.

Thanks for your input!

SSF