SAWdoubler: A program for counting self-avoiding walks

Published: 01-03-2013| Version 1 | DOI: 10.17632/xv59s4ckxg.1
Raoul D. Schram,
Gerard T. Barkema,
Rob H. Bisseling


This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018) Abstract This article presents SAWdoubler, a package for counting the total number Z N of self-avoiding walks (SAWs) on a regular lattice by the length-doubling method, of which the basic concept has been published previously by us. We discuss an algorithm for the creation of all SAWs of length N , efficient storage of these SAWs in a tree data structure, and an algorithm for the computation of correction terms to the count Z 2 N for SAWs of double length, removing all combinations of two intersecting... Title of program: SAWdoubler Catalogue Id: AEOB_v1_0 Nature of problem Computing the number of self-avoiding walks of a given length on a given lattice. Versions of this program held in the CPC repository in Mendeley Data AEOB_v1_0; SAWdoubler; 10.1016/j.cpc.2012.10.026