PPT Slide
0000
1000
0100
0010
0001
1100
1010
0110
1001
0011
0101
1111
1110
1101
1011
0111
When it finds a valid snake it prints it out. Then it
backtracks (as if it had found an error) and chooses other
points that haven’t been tried.
Previous slide
Next slide
Back to first slide
View graphic version
Notes:
This process causes the program to gradually work through all of the possible paths.