containers (let's call them bags, supposing they're XYZ from "Garlic",
above).
-A computer will be involved. It will produce two sets of secret
-output, one for player 1 and one for player 2 (WLOG there are at least
-2 players)
-
All players collaborate to parepare bags, one for each player,
according to each of XYZ. So now (for eg two players) we have bags:
X0 Y0 Z0
Y: bag, bag, ...
Z: bag, bag, ...
-Everyone but player 1 leaves the room. Player 1's secret output
-instructs them to move bag-pairs X Y Z to new locations alpha, beta,
+Everyone but player 1 leaves the room. Player 1 rolls dice
+to randomly move move bag-pairs X Y Z to new locations alpha, beta,
gamma, according to a random permutation. Now we have:
alpha: bag, bag, ...
beta: bag, bag, ...
gamma: bag, bag, ...
-Everyone but player 1 leaves the room. Player 2's secret output
-instructs them to select one of alpha, beta, or gamma. The others are
-put aside:
+Everyone but player 1 leaves the room. Player 2's rolls a die to
+select one of alpha, beta, or gamma. The others are put aside:
selected: bag, bag, ...
- discarded: many bags
+ set aside (secret): many bags
At the end of the game, everyone must reveal their bags. Perhaps we
declare that at the start of round 5 (at the extra garlic) everyone