Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re: Magic Squares Guessing

by Ratazong (Monsignor)
on Nov 03, 2011 at 07:49 UTC ( [id://935597]=note: print w/replies, xml ) Need Help??

in reply to Magic Squares Guessing

I would create a data-structure consisting of

  • a partly filled square
  • the list of numbers you need to place

Then you could use a recursive algorithm like the following:

  1. select an element from the number-list (*)
  2. select an empty position
  3. place the element at the position
  4. check, if the square is still consistent (all completely filled lines sum up to 175)
    • if yes, repeat the step with the new square and the reduced number-list
    • if no, restore the previous state (of number-list and square) and try with the next number and/or position
If the number-list is empty in step 1, you have found a solution.

Once you have your basic algorithm, you can optimize. E.g. your selection-algorithms and your consistency-checks. That's when the real fun starts :-) (because you can add "intelligence" instead of pure "brute-force")

Hope this helps! Rata

(*) a basic selection-algorithm could be going from first to last.

Log In?

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

How do I use this?Last hourOther CB clients
Other Users?
Others examining the Monastery: (3)
As of 2024-07-19 06:24 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.