Talk:Random Latin squares: Difference between revisions
→"restarting row" method
No edit summary |
|||
Line 33:
:: To the best of my knowledge, it does, in fact, generate uniformly random latin squares. https://www.academia.edu/29890346/Comparison_of_Seven_Techniques_for_Generating_Random_Latin_Squares See page 2. --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 19:32, 16 July 2019 (UTC)
::: OK it will have to be pistols at dawn then. Darn in these politically correct times that is not allowed. In my country we can't even have pistols. We'll have to settle for testing it then. Consider the following 4 Latin Squares of order 4:
<pre>
a b c d
0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3
1 0 3 2 1 0 3 2 1 2 3 0 1 3 0 2
2 3 0 1 2 3 1 0 2 3 0 1 2 0 3 1
3 2 1 0 3 2 0 1 3 0 1 2 3 2 1 0
</pre>
::: If the factor code is used to produce a large number of random Latin Squares of order 4, say 1 million, my conjecture is that c and d will be produced twice as often as a and b. Your conjecture is they will be produced equally. Do you fancy giving it a go?--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 01:29, 17 July 2019 (UTC)
:: in particular, you may find this interesting: "The probability of finishing the entire LS is a combination of the previous series of probabilities, but not their product, as the rows are not independent to each other (i.e. row i depends of values on row i-1)." --[[User:Chunes|Chunes]] ([[User talk:Chunes|talk]]) 19:37, 16 July 2019 (UTC)
| |||