{"version":"1.0","type":"link","title":"Self-avoiding walk - Newikis","description":"In mathematics, a self-avoiding walk (SAW) is a sequence of moves on a lattice (a lattice path) 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 (SAP) is a closed self-avoiding walk on a lattice. Very little…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/5/5b/Self_avoiding_walk.svg/1280px-Self_avoiding_walk.svg.png","thumbnail_width":1280,"thumbnail_height":1280}