Solution:
Answer: 1445
For each positive integer n, let En denote the expected number of rounds required to determine a winner among n people. Clearly, E1=0. When n=2, on the first move, there is a 31 probability that there is a tie, and a 32 probability that a winner is determined. In the first case, the expected number of additional rounds needed is exactly E2; in the second, it is E1. Therefore, we get the relation
E2=31(E2+1)+32(E1+1),
from which it follows that E2=23.
Next, if n=3, with probability 91 there is only one distinct play among the three players, and with probability 276=92 all three players make different plays. In both of these cases, no players are eliminated. In all remaining situations, which occur with total probability 32, two players make one play and the third makes a distinct play; with probability 31 two players are eliminated and with probability 31 one player is eliminated. This gives the relation
E3=31(E3+1)+31(E2+1)+31(E1+1),
from which we find that E3=49.
Finally, suppose n=4. With probability 271, all four players make the same play, and with probability 813⋅6⋅2=94, two players make one play, and the other two players make the other two plays; in both cases no players are eliminated, with total probability 271+94=2713 over the two cases. With probability 816⋅4=278, three players make one play and the fourth makes another; thus, there is a probability of 274 for exactly one player being eliminated and a probability of 274 of three players being eliminated.
Then, there is a remaining probability of 816⋅3=92, two players make one play and the other two players make another. Similar analysis from before yields
E4=2713(E4+1)+274(E3+1)+92(E2+1)+274(E1+1)
so it follows that E4=1445.