Mathematica 9 is now available Services & Resources /
Wolfram Forums / MathGroup Archive  MathGroup Archive 2008
[Date Index] [Thread Index] [Author Index]  Search the Archive
Hash Table for self avoiding random walks    • To: mathgroup at
• Subject: [mg88453] Hash Table for self avoiding random walks
• From: "jwmerrill at" <jwmerrill at>   • Date: Mon, 5 May 2008
06:17:32 -0400 (EDT)  Executive Summary:  Can I make a bunch of
things that work like hash tables without polluting the global
scope?  Long winded Version:  I've been playing around with self
avoiding random walks.  Generating them efficiently requires a
fast way of checking whether a given step will intersect the set
of previous steps, which is generally a sparse subset of the
underlying lattice.  Using a list of the previous steps isn't so
great because searching it for collisions is order the size of
the list.  Using an array isn't so great because it has
predefined boundaries and because, as the dimensionality
increases, the size of the ar