PPT Slide

0000

1000

0100

0010

0001

1100

1010

0110

1001

0011

0101

1111

1110

1101

1011

0111

TailWagger starts at point 0000. It chooses one of four

possible points. It then has three more choices, chooses

one and checks to see if the snake has violated any rules.

Previous slide

Next slide

Back to first slide

View graphic version

TailWagger blindly tries all of the possible pathways in an N-cube in order to find all of the snakes in that N-cube.