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

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.)



  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


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.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.