A new algorithm to enumerate the self-avoiding random walk

Presents a new algorithm for enumerating the self-avoiding walk and extend the existing series of 19 terms by one more term on a triangular lattice. The leading correction-to-scaling exponent Delta 1 for the mean-square end-to-end distance of the self-avoiding walk is found to be less than one.