GitHub - ethomas2/counting-nodes

given a 4x8 grid where you start at the top left

S - - - - - - -
- - - - - - - -
- - - - - - - -
- - - - - - - -

how many "self-avoiding" paths are there (ie a path which does not intersect itself)
how many "self-avoiding" "terminal" where terminal is defined as a path that cannot be extended

Name		Name	Last commit message	Last commit date
Latest commit History 18 Commits
.gitignore		.gitignore
README.md		README.md
estimate.py		estimate.py
main.1.go		main.1.go
main.1.py		main.1.py
main.2.go		main.2.go
main.2.py		main.2.py
main.3.go		main.3.go
multiadd.go		multiadd.go
traverse.go		traverse.go

Provide feedback