Method for player-influenced random distribution of game tokens

1. A method of distributing game tokens to players in a game wherein the game comprises the distribution of game tokens to n players, P 1 , P 2 , . . . P n , where n is greater than 1, the method comprising the steps of:

(a) obtaining from each player P i a first unit A i , wherein each A i is chosen from a finite set of discrete candidate first units;

(b) obtaining from each player P i a second unit B i , wherein each B i is chosen from a finite set of discrete candidate second units;

(c) deriving a third unit C using a predetermined algorithm where C=f(B 1 , . . . ,B n );

(d) assigning a previously unassigned game token G i to each player from a predetermined algorithm where G i =f(A i , C); and

(e) repeating steps (a)-(d) until a predetermined number of game tokens cards are distributed to each player.

2. The method of claim 1 wherein the game tokens are playing cards.

3. The method of claim 1 wherein the first units are playing cards.

4. The method of claim 1 wherein the second units are integers.

5. The method of claim 4 wherein C=ΣB i .

6. The method of claim 1 further comprising the steps of, after the predetermined number of game tokens are distributed in step (e), a community token H is chosen by obtaining from each player P i a new unit J i and determining the community token H by a predetermined algorithm H=f(J 1 , . . . , J n ).

7. The method of claim 1 wherein each A i obtained from step (a) and each B i obtained from step (b) is inputted into a computer and the computer derives C in step (c) and each assigned game token G i in step (d).

8. The method of claim 7 wherein the computer is a digital computer.

9. A method of distributing playing cards to players in a game wherein the game comprises the distribution of playing cards to n players, P i , P 2 , . . . , P n , wherein n is greater than 1, the method comprising the steps of:

(a) providing a digital computer;

(b) entering into the computer a first unit A i , where each A i , is chosen from a finite set of discrete candidate first units;

(c) entering into the computer a second unit B i , wherein each B i is chosen from a finite set of discrete candidates second unit;

(d) deriving, using the computer, a constant C from a predetermined algorithm where C=f(B i , . . . , B n );

(e) using the computer, assigning a previously unassigned card G i to each player from a predetermined algorithm where G i =f(A i , C); and

(f) repeating steps (b)-(e) until a predetermined number of playing cards are distributed to each player.

10. The method of claim 9 wherein the first units are playing cards.

11. The method of claim 9 wherein the second units are integers.

12. The method of claim 11 wherein C=ΣB i .

13. The method of claim 9 further comprising the steps of, after the predetermined number of playing cards are distributed in step (f), a community playing card H is chosen by obtaining from each player P i a new unit J i and, using the computer, determining the community playing card H by a predetermined algorithm where H=f(J i , . . , J n ).

14. A method of distributing playing cards to players in a game wherein the game comprises the distribution of playing cards to n players, P i , P 2 , . . . , P n , wherein n is greater than 1, the method comprising the steps of:

(a) providing a digital computer;

(b) entering into the computer a first unit A i , where each A i , is chosen from a finite set of discrete candidate first units;

(c) entering into the computer a second unit B i , wherein each B i is an integer chosen from a finite set of discrete candidate integers;

(d) deriving, using the computer, a constant C from a predetermined algorithm where C=f(B i , . . . , B n );

(e) using the computer, assigning a previously unassigned card G i to each player from a predetermined algorithm where G i =f(A i , C);

(f) repeating steps (b)-(e) until a predetermined number of playing cards are distributed to each player; and

(g) choosing a community card H after the predetermined number of playing cards are distributed in step (f), a community of playing card H is chosen by obtaining from each player P i a new unit J i and, using the computer, determining the community playing card H by a predetermined algorithm where H=f(J 1 , . . . , J i ).

15. The method of claim 14 wherein the first units are playing cards.

16. The method of claim 14 wherein C=ΣB i .