The following are visual representations of a PSP algorithms as they are applied to randomly generated "toy" examples in two-dimmensional space. Though these models are very simple, the principles displayed here remain the constant for vastly more complex ones. The drop-down menu to the left changes the amount of cycles before completion of the algorithm, while the menu to the right changes the amount of "active" regions to be generated.
The following example visually demonstrates how the algorithm adapts
the jumping distribution so that each one is appropriate for the region
it is in. Note how multiple sampling loops run parallel to each other
except when a new region is found. When a new region is found all loops
are stopped while the new region catches up. Because a delay is placed
in this example, if you select to have the algorithm run for many
loops, a substantial amount of time may be taken before it finishes.
(Note: If the following Applets do not open,
make sure you have Java 2 Platform
installed in your computer. You can get this program from
The next example places the sampled points in the empty space to the right of the randomly generated pattern on the left. Each sampled point is placed as an orange pixel on the screen. After the algorithm loops the amount of times specified by the user, lines are generated which show the boundries of the region which the algorithm estimates.