Using a simple algorithm to get the minimun, maximun and average distance from (0,0) moving randomly just 1 point per step. In a virtual environment

• Python

• Bokeh (plotting)
  

• 1000 Reps for each test
• 10 steps (Min: 0 / Max: 10 / Avg: 3)

• 50 steps (Min: 0 / Max: 24 / Avg: 7 )

• 100 steps (Min: 0 / Max: 34 / Avg: 11 )

• 200 steps (Min: 0 / Max: 56 / Avg: 15 )

• 500 steps (Min: 2 / Max: 82 / Avg: 25 )

• 1000 steps (Min: 0 / Max: 112 / Avg: 34 )