Scalable solution for Rock-Paper-Scissor

Question

Just went through a variant of the game : Rock-Paper-Scissor-Lizard-Spock

I have written a Java code for traditional R-P-S problem, but when I tried extending my code

Answer 1

Design an enum Choice (ROCK, PAPER, SCISSORS), where each enum has a Set<Choice> which it wins against.

Have each of your players choose one of the choices.

Iterate through your players, and for each one, iterate over all the other players that are after him in the list of players (for player 0, iterate through players 1, 2, 3, etc; for player 1, iterate through players 2, 3, etc.; ...).

For each match, you have three possibilities:

1. A beats B (the choice of B is in the set of choices that A beats): increment A's score
2. A and B have the same choice: do nothing
3. A doesn't beat B: increment B's score