Just another Perl shrine PerlMonks

### Re: Re: Code to solve the "matrix formation" puzzle

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

It looks like exponential-order to me. I added some code to sum up the number of permutations of the sets:
```  \$bigtotal += Math::NumberCruncher::Permutation(scalar(@Num),MATRIX_D
+IM);
@Sol=CheckSolution(\@Num);
Here are the results:
```Order 4:
Maximum divisor is 416, solution is 2496-9152-1664-2080
Checked 19301184 cases
1445.940u 5.500s 27:10.91 88.9% 0+0k 0+0io 364pf+0w

Order 3:
Maximum divisor is 44, solution is 132-792-660
Checked 140526 cases
10.690u 0.050s 0:14.69 73.1%    0+0k 0+0io 364pf+0w

Order 2:Maximum divisor is 7, solution is 21-84
Checked 820 cases
0.290u 0.010s 0:00.33 90.9%     0+0k 0+0io 364pf+0w
At that rate, order 5 will test about 1 billion cases and take over a day to run. But I think it might be feasible if bad solution sets are eliminated early.

The big problem is the permutations, which are factorial order. I would suggest picking the corner two items first. They have to have the same top digit. Then that determines the possible top digits of the rest of the rows.

Create A New User
Node Status?
node history
Node Type: note [id://267684]
help
Chatterbox?
 LanX grins [marto]: anyway, don't come to Glasgow for the football :) [holli]: the hell? i have a scriptblocker on. [holli]: how do you update a different window without javascript? [holli]: ah, chatterbox right [marto]: it's a normal HTML form, with some hidden input fields [holli]: forgot that thing exists for a moment. LanX welcome to the twilight zone ... [Eily]: LanX well since the onion is your eye you should see it everywhere [marto]: sounds eye watering

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (12)
As of 2017-12-14 16:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
What programming language do you hate the most?

Results (398 votes). Check out past polls.

Notices?