Floating Random Walk Solution to the Dirichlet Problem

domain

random walks settings:

seed:

1

reset locator

number of walks

1

5

10

15

20

selected walk

1

A floating random walk in a two-dimensional region

D

starts at a point inside

D

and takes steps of length equal to the minimum distance from the current location to the boundary of

D

. This Demonstration illustrates floating random walks for regions of various shape.