10176

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

### DETAILS

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.

### PERMANENT CITATION

Contributed by: Aaron Dunigan AtLee
Based on a program by: Jake Zhang
 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 » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.