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

Re: Magic Squares Guessing

by JavaFan (Canon)
on Nov 03, 2011 at 10:14 UTC ( [id://935619]=note: print w/replies, xml ) Need Help??

in reply to Magic Squares Guessing

What I would do:
  1. If no open squares remain, you're done.
  2. If there's an open square that is the only open square in its row or column, goto 3. Else, goto 4.
  3. Pick an open square that is the only open square in its row or column. Calculate what the value should be. If the value is invalid (used already, greater than 20, less than 1, or different for the row and columns), return (from recursion, or overall -- in the latter case, it's unsolvable). If it's valid, fill in. Goto 1.
  4. Find a row or a column with the least number of open squares (but one that still has open squares). Pick one of its open squares. For each unused value 1 .. 20 try filling it in in the open square. Recurse.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://935619]
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others browsing the Monastery: (2)
As of 2024-07-21 04:56 GMT
Find Nodes?
    Voting Booth?

    No recent polls found

    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.