Random Latin squares: Difference between revisions
Content added Content deleted
(Added Quackery.) |
(→{{header|F_Sharp|F#}}: the evidence suggests the method is not equivalent to random sampling from the universe) |
||
| Line 776: | Line 776: | ||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |
||
This solution uses functions from [[Factorial_base_numbers_indexing_permutations_of_a_collection#F.23]] and [[Latin_Squares_in_reduced_form#F.23]]. |
This solution uses functions from [[Factorial_base_numbers_indexing_permutations_of_a_collection#F.23]] and [[Latin_Squares_in_reduced_form#F.23]]. It has been alleged that this solution generates completely random uniformly distributed Latin Squares from all possible Latin Squares of order 5. It takes 5 thousandths of a second to do so. |
||
<syntaxhighlight lang="fsharp"> |
<syntaxhighlight lang="fsharp"> |
||
// Generate 2 Random Latin Squares of order 5. Nigel Galloway: July 136th., 2019 |
// Generate 2 Random Latin Squares of order 5. Nigel Galloway: July 136th., 2019 |
||