PPT Slide

Why hasn’t TailWagger found every snake in 7-space?

Because the upper bound for the number of TailWags (iterations) for Nɲ is

3-space 3**6 = 7.2x10**2 = 729

4-space 4**8 = 6.5x10**4 = 65536

5-space 5**14 = 6.1*10**9 = 6103515625

6-space 6**26 = 1.7*10**20 = 170581728179578208256

7-space 7**48 = 3.6x10**40 = 36703368217294125441230211032033660188801

It will

never

find them all.

Previous slide

Next slide

Back to first slide

View graphic version

Although TailWagger doesn’t have to go through all of those iterations in order to find all of the snakes in an N-cube, you can see why it hasn’t found them all in 7-space. The problem is too big for TailWagger’s BFI coding.