source
article
steps per walk
= 1000
feedback
= never
at step
freq[
0
]
std dev
max abs(total)
walk?
close
A Feller's walk comprises 1000 steps. At each step you flip a coin, keeping a running total (starting at zero)
adding one each time you flip a head
subtracting one each time you flip a tail
How will the total behave along the walk?
ok