Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Code to solve the "matrix formation" puzzle

by tall_man (Parson)
on Jun 20, 2003 at 16:44 UTC ( #267644=note: print w/replies, xml ) Need Help??

in reply to Code to solve the "matrix formation" puzzle

Looks great, but you didn't use any of the solution-space reducing tricks I suggested in the other thread. Oh well, it turns out that when you get close to the solution, in most cases all the numbers get into the candidate lists.

In the inner loop, I think assigning to a hash is cheaper than deleting from it, so it might be better to assign 0 or undef instead of removing elements.

You mentioned not seeing an algorithm for permutations of n distinct numbers taken r at a time. You could use Algorithm::ChooseSubsets to select the elements, and then permute them with Algorithm::FastPermute.

  • Comment on Re: Code to solve the "matrix formation" puzzle

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (5)
As of 2023-05-30 18:13 GMT
Find Nodes?
    Voting Booth?

    No recent polls found