Instructions: Please play with the buttons and sliders. You can figure it out faster than I can explain it.

Zeno paths start at *x* = 1/2 and step either left (toward 0) or right (toward 1) with equal probability. The length of each step is equal to one-half of the distance to whichever boundary is nearer. Observation suggests that after the first few steps, the walker is much more likely to be found near 0 or 1 than in the middle of the segment. But a question remains: If the walk were allowed to continue indefinitely, would the walker get stuck on one side or the other, or would it cross back and forth over the midline infinitely often?

Source code: zenowalk button scrollbar

Built with Processing