[seqfan] Re: Quick question about self-avoiding walks

Chris cgribble263 at btinternet.com
Sat Dec 10 21:05:06 CET 2011

Another take on this is the number of directed maximum-length
non-self-intersecting paths in an nxn square lattice (see A096969).

I have a C++ program that will calculate such values.  However, the CPU time
required grows massively as n increases.

Best regards,

Chris Gribble

-----Original Message-----
From: seqfan-bounces at list.seqfan.eu [mailto:seqfan-bounces at list.seqfan.eu]
On Behalf Of Alonso Del Arte
Sent: 10 December 2011 06:27
To: Sequence Fanatics Discussion list
Subject: [seqfan] Quick question about self-avoiding walks

Does the OEIS have the sequence of the number of distinct self-avoiding
walks possible on an n^2 lattice where every vertex is visited? Here is an
example of what I'm talking about:
http://oeis.org/wiki/File:Walks_on_8_by_8_SqLattice.png I would look it up
myself but I don't know the proper word for it nor have I thought about how
to calculate terms.



Seqfan Mailing list - http://list.seqfan.eu/

More information about the SeqFan mailing list