|
|
I've been playing with and modifying a program by Mark Formaneck which generates random self-avoiding walks and then runs a pivot algorithm on them to compute some averaged properties of them. This week and this week only, see pictures of the initial random walks/chains, and the relaxed walks/chains the algorithm ends up with.
Monday Februrary 8, 1999 |
500 Bead Chains |
Tuesday February 9, 1999 |
1000 Bead Chains |
Wednesday February 10, 1999 |
3000 Bead Chains |
Thursday February 10, 1999 |
5000 Bead Chains |
Friday February 11, 1999 |
Branched 100 Bead Chains |
Saturday February 12, 1999 |
Branched 5000 Bead Chains |