Anonymous user
Talk:Find the missing permutation: Difference between revisions
Talk:Find the missing permutation (view source)
Revision as of 11:10, 25 December 2009
, 14 years ago→Perl shuffle: mersenne twister.
(→Prototype Tcl Solution: I hadn't tried any of the Tcl tasks, myself.) |
(→Perl shuffle: mersenne twister.) |
||
Line 19:
:::: Yeah, [http://www.jstatsoft.org/v11/i01/paper this paper (see page 48)] suggests that <code>perl</code>'s <code>rand</code> isn't guaranteed to be much good. —[[User:Underscore|Underscore]] ([[User talk:Underscore|Talk]]) 17:15, 24 December 2009 (UTC)
::::: The table on p.53 shows about what I'd expect; the standard rand() is not suitable for either crypto or (proper) Monte Carlo use, and this is normal for a general use RNG in any language. But for shuffling a short list of permutations for a RC task, well, it's just fine. The mixing up is just to make the answer not blindingly obvious after all. –[[User:Dkf|Donal Fellows]] 19:00, 24 December 2009 (UTC)
:::::: Python uses [[wp:Mersenne twister]] as its PRNG which is supposed to be of high quality. There is a Perl implementation [http://search.cpan.org/search?module=Math%3A%3ARandom%3A%3AMT%3A%3AAuto om CPAN]. --[[User:Paddy3118|Paddy3118]] 11:10, 25 December 2009 (UTC)
::::: BTW, it might be worth seeing if there's any ideas for tasks that can be harvested from that paper. After all, it's always good to encourage less-experienced programmers to understand the limits of the PRNGs they're using. –[[User:Dkf|Donal Fellows]] 19:03, 24 December 2009 (UTC)
| |||