Jump to content

Round-robin tournament schedule: Difference between revisions

m
(Implemented 2 Python solutions to Round-Robin Tournament Schedule task)
Line 1,123:
This seems to be related to the OEIS sequence [https://oeis.org/A036981 "A036981: (2n+1) X (2n+1) symmetric matrices each of whose rows is a permutation of 1..(2n+1)"]. The next term (for N=10) would be 444733651353600 which takes too long to check.
=={{header|Python}}==
===Original method by R. Schurig===
<syntaxhighlight lang="python">
# round_robin.py by Xing216
Line 1,179:
Round 12: 7-6 8-5 9-4 10-3 11-2 12-1
</pre>
 
==Berger Tables==
<syntaxhighlight lang="python">
35

edits

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