CURE: Interdisciplinary Undergraduate Research: Enumerating Self-Avoiding Walks

Enumerating Self-Avoiding Walks

CURE: Interdisciplinary Undergraduate Research: Enumerating Self-Avoiding Walks


Christopher Krause


Dr. Anne Donnelly


Herbert Wertheim College of Engineering


A self-avoiding walk is a series of moves on the lattice grid that does not revisit the same point twice. Although these mathematical structures are simple to define and understand, they exhibit extremely complex and unpredictable behavior. In my project, I attempt to calculate the number of “block self-avoiding walks” of length n on the lattice grid. Simple solutions to this problem have repeatedly eluded the cleverest of problem-solvers. Currently, only 35 terms of the sequence have been found. Here, I present a novel approach to the classic combinatorics problem that can be applied to other types of self-avoiding walks.


Hover over the image below to zoom in or click to view full screen.

Research Pitch

View a 3-minute research pitch below.

To comment below, please sign in with Facebook or Google (using your ufl account) by clicking the little round icons to the right. If you decide, you can post as a guest by entering name and email below, but will lose some features. You can also subscribe to the student’s page to get email updates on new comments.

Leave a Reply