Talk:Random Latin squares: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 1: | Line 1: | ||
==[[Latin Squares in reduced form]]== |
|||
[[Latin Squares in reduced form]] makes trivial uniformly generating random Latin Squares up to order 6. 3 random numbers are required. The first in the range 1 to number of reduced Latin Squares of order n is used to select a member of the set of reduced Latin Squares of order n. The second in the range 1 to n! is used to select a permutation of the columns of the selected reduced Latin Square. The third in the range 1 to (n-1)! is used to select a permutation of the rows 2 to n.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 09:51, 12 July 2019 (UTC) |
|||
==Revert to draft== |
==Revert to draft== |
||
I think the task description needs to require and demonstrate that the algorithm must be capable of producing all valid latin squares of size n. As it stands starting from a valid latin square, which is easy to generate say: |
I think the task description needs to require and demonstrate that the algorithm must be capable of producing all valid latin squares of size n. As it stands starting from a valid latin square, which is easy to generate say: |
||