Self-Avoiding Paths through a Lattice

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

This Demonstration shows the paths from the southwest corner of an square lattice to the northeast corner that do not intersect themselves. For a given lattice, the number of self-avoiding paths is greater than , which is the number of paths containing only steps north and east, since self-avoiding paths can also take steps south and west.

Contributed by: Robert Dickau (March 2011)
Open content licensed under CC BY-NC-SA



For more information, see A007764 of The On-Line Encyclopedia of Integer Sequences.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.