Exact enumeration of self-avoiding walks
  A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making the process thousands or millions of times faster. This allowed us to enumerate self-avoiding walks on the simple cubic lattice up to a length of 36 steps. 
Raoul D. Schram, Gerard T. Barkema and Rob H. Bisseling
math-ph cond-mat.soft math.MP