Jump to content

Random Latin squares: Difference between revisions

→‎{{header|F_Sharp|F#}}: the evidence suggests the method is not equivalent to random sampling from the universe
(Added Quackery.)
(→‎{{header|F_Sharp|F#}}: the evidence suggests the method is not equivalent to random sampling from the universe)
Line 776:
 
=={{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]]. ThisIt 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 canto thatdo really be called hard?so.
<syntaxhighlight lang="fsharp">
// Generate 2 Random Latin Squares of order 5. Nigel Galloway: July 136th., 2019
2,471

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.