Rock Paper Scissors for arbitrary odd number of elements
- by Barry Carter
How do I efficiently create a rock-scissors-paper game for n elements,
where n is any odd number =3.
In other words, I want a non-transitive complete ordering of n elements
such that each element is greater than (n-1)/2 other elements and each
element is lesser than (n-1)/2 other elements.