In mathematics, a self-avoiding walk is a sequence of moves on a lattice that does not visit the same point more than once. This is a special case of the graph theoretical notion of a path. A self-avoiding polygon is a closed self-avoiding walk on... Wikipedia