Counts the uncrossing pathways in an n^2 corodinate system. I intend to duplicate the functionality in C and Haskell for practice/curiosity. For more information see http://mathworld.wolfram.com/Self-AvoidingWalk.html
-
Notifications
You must be signed in to change notification settings - Fork 0
ColtonKinstley/Self-Avoiding-Walk
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Releases
No releases published
Packages 0
No packages published