mostly on computers and mathematics
Given a collection of games between players (or teams), find as many nontransitive loops as possible, e.g., A beats B, B beats C, C beats A.
Such loopiness may signal a well-designed sport: there are many ways to win, many ways to lose.
Post a Comment
No comments :
Post a Comment