Jimmy's original rg outperforms both tock and the best of
my various attempts at "new" for "larger" problems, eg
10 ts 'rg^:10000 #~400'
0.633403 38272
10 ts 'tock^:10000 #~400'
0.751826 34816
10 ts 'new^:10000 #~400'
0.793394 39424
NB. less good on smaller ones
30 ts 'rg^:10000 #~10'
0.10968 6784
30 ts 'tock^:10000 #~10'
0.0662844 3840
30 ts 'new^:10000 #~10'
0.0633482 3968
(Have you looked at Raul's results table, posted on 20/7?)
The original problem asked us to consider 100 players,
but, as usual, it's one thing to solve a small puzzle that you
can get your head round, but very often a much more challenging
requirement to get it to scale up.
Those many Project Euler problems are worth looking at with
scale of application in mind. ( //projecteuler.net )
Thanks,
Mike
On 27/07/2017 05:54, Raul Miller wrote:
Oh, well, you could make it tacit. For example:
rg=:(((#/.~@])`(~.@])`(0*[)} +/?@##)+-) *
That does not speed it up, though.
Anyways, good luck,
---
This email has been checked for viruses by Avast antivirus software.
https://www.avast.com/antivirus
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
