A Random Walk on a Random Rock-Paper-Scissors Graph

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Vertices of a random graph are assigned colors to represent Rock (Red), Paper (Purple), and sCissors (Cyan). A "walker" (black circular outline) takes a random walk along the edges of the graph. As it moves from vertex to vertex , if beats (in the sense of the game Rock-Paper-Scissors: rock beats scissors, scissors beats paper, paper beats rock), then vertex is changed to the color of . (If beats , no change is made.)

Contributed by: Aaron Dunigan AtLee (March 2011)
Based on a program by: Jake Zhang
Open content licensed under CC BY-NC-SA



Each edge of the graph has probability 0.5 of being created; however, if the random graph chosen has any isolated vertices, it will be re-chosen so as to avoid the walker being stuck on the isolated vertex.

When you change "number of vertices", a new random graph is created with the desired number of vertices.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.