A three-state cycle
Rock, Paper, and Scissors form a cyclic game: rock beats scissors, scissors beats paper, and paper beats rock. Against an opponent who chooses each move with probability 1/3, each fixed move wins 1/3, loses 1/3, and ties 1/3. The tool selects one of the three moves with equal probability.
Reading a single round
Suppose you choose Rock and the tool returns Paper. Paper covers Rock, so that round is a loss. If it returns Rock, the round is a tie rather than a hidden win for either side. If it returns Scissors, Rock wins. Across 90 independent random rounds, the expected counts are 30 wins, 30 losses, and 30 ties, but a small set can vary widely.
Why patterns are not strategy
A random generator has no intention to exploit. Choosing Paper because Scissors appeared twice does not improve its chance against an independent random move; every next result remains one-third each. Strategy matters only when the other player is human and may react to habits, which this simulator does not model.
Agree on tie handling
One round can end tied one-third of the time. Decide in advance whether a tie means replay immediately, count no point, or start a best-of series. Without that agreement, a fair move generator can still leave the contest unfinished.
Scope of this tool
This is the classic three-move game, not a five-move variant and not a tournament bracket. It supplies a random opponent move or a neutral single-round result; it cannot assess skill, predict a person, or resolve a decision with unequal real-world consequences.
A game check
Before playing, verify that both sides use the same cycle: Rock beats Scissors, Scissors beats Paper, Paper beats Rock. A variant with extra moves changes the payoff table and is no longer a one-third, one-third, one-third experiment. The result shown here belongs only to the standard cycle. Say the moves simultaneously; a player allowed to react after hearing the other move is not playing the same game. In a scored match, count ties separately from wins and losses. A replay-on-tie rule changes the duration of a round, while a tie-as-no-point rule changes the scoreboard; neither follows automatically from the three-move cycle.
Why mixed play has the same baseline
Against a player who can observe habits, choosing the same move repeatedly may become predictable. The standard game-theory response is to randomize each move with probability one-third. That prevents an opponent from gaining an advantage from a fixed pattern, but it does not promise a win in one round. The browser can supply an independent move; it cannot model bluffing, reaction time, or a player's prior decisions.
The payoff table has no permanently safe move
Write the three choices as R, P, and S. Against an opponent using each move one third of the time, Rock wins against S, loses to P, and ties R, so its expected score is balanced; the same calculation holds for Paper and Scissors. A player who always chooses Rock gives a responsive opponent a clear counter: Paper. The standard mixed strategy assigns probability 1/3 to every move, leaving no exploitable preference in the one-round payoff table. That result describes a strategic game, not a prediction that people will behave randomly.
A scored match needs a stated tie convention
Imagine first to three points. In six simultaneous rounds the pairs are R/S, P/P, S/R, R/P, P/S, S/S. The first and third pairs are wins for the left player, the fourth and fifth are losses, and the second and sixth are ties: the score is 2–2, not 4–4. If ties are replayed, two extra rounds may be needed before anyone reaches three; if ties count as half-points, the same sequence produces 3–3. A move generator can select the symbols, but it cannot infer which scoring convention the players intended.
Simultaneous choice is a rule, not decoration
The familiar cycle only produces a fair contest when neither player sees the other move in time to respond. A host who announces Rock before the other player chooses has already given that player a winning answer, Paper. For a remote game, have both players send an emoji at a fixed time, or use a commit-and-reveal method if the result has value. This page can supply a neutral opponent move or settle a one-person prompt; it cannot prove that two human players revealed independently, identify cheating, or make unequal stakes acceptable.
Practice patterns are evidence, not probability laws
A human opponent may favor a move after winning or switch after losing. Watching a short history can therefore inform a practical guess, but it is not the same as a fair random baseline. Record enough rounds before claiming a habit and do not mistake two consecutive Papers for a law. Against an unknown opponent, the equal one-third mix is the defensible default because it does not advertise a counter. Against a programmed generator, psychological pattern-reading has no input at all.
Use the same vocabulary
Before play, confirm that both players mean the standard three symbols and that no local gesture changes the rule. A contest cannot be settled by a correct payoff table if participants apply different names or exceptions after revealing their moves.
A mixed strategy is a distribution, not a rotation
Against an opponent with no known pattern, selecting Rock, Paper, and Scissors with probabilities 1/3, 1/3, and 1/3 makes each opposing fixed move break even on average: against Rock, Paper wins one third, Rock ties one third, and Scissors loses one third. The expected score is zero if a win is +1 and a loss is −1. Alternating Rock, then Paper, then Scissors has the same counts over three rounds but is predictable after the first move; an opponent who sees the cycle can choose the counter rather than facing an equal mixture.
Questions about this selection
What happens when both moves match?
The round is a tie under the standard rules.
Is a repeated move less likely?
No. A random move does not remember the preceding round.
Other chance methods
All coins and lots tools · Random Lot Picker · Odds or Evens Picker