Tag Archives: self-avoiding walks

Generate self-avoiding walks one at a time in C#

The example Generate random self-avoiding walks in C# uses a timer to display self-avoiding walks at regular intervals. It generates each walk randomly as it is needed. That’s great if you want to display random walks, but what if you … Continue reading

Posted in algorithms, drawing, graphics, mathematics | Tagged , , , , , , , , , , , , | Leave a comment

Generate random self-avoiding walks in C#

The previous examples that display self-avoiding walks generate all of the possible walks for a given lattice and then let you select one. Because the programs use a recursive search to find walks, walks near the same part of the … Continue reading

Posted in algorithms, drawing, graphics, mathematics | Tagged , , , , , , , , , , , , | Leave a comment

Find corner-to-corner self-avoiding walks in C#

The example Find self-avoiding walks in C# shows how to find self-avoiding walks. This example modifies that one so it only picks self-avoiding walks that start in the upper left corner and that end in the lower right corner. This … Continue reading

Posted in algorithms, drawing, graphics, mathematics | Tagged , , , , , , , , , , , , | Leave a comment

Find self-avoiding walks in C#

This is the first post in a short series that find and display self-avoiding walks. In general, self-avoiding walks are paths that don’t cross themselves. You could call them non-self intersecting paths if you like. Usually self-avoiding walks have movement … Continue reading

Posted in algorithms, drawing, graphics, mathematics | Tagged , , , , , , , , , , , , | Leave a comment