Self-Avoiding Paths through a Lattice

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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


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

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.