An Algorithm that plays a perfect game of Snake. (Python Turtle)

ALGORITHMS: --------------------------------------

HAMILTONIAN CYCLE: A Hamiltonian Cycle is generated by creating a Minimum Spanning Tree using the Prim method. This tree is used as a maze for a runner to travel through by going in a priority order of left, straight, and right. This traversing maneuver leads the history of the runner to become a Hamiltonian cycle through every node on the grid.

SHORTCUT ALGORITHM: The Hamiltonain Cycle is used as a base for a snake to travel on. The snake loosely follows the order of the cycle, but is allowed to take shortcuts through the cycle. This leads the snake to travel to the food faster than just plainly following the Hamiltonian Cycle. The algorithm is an implementation of an algorithm written by John Tapsell, who was the first to invent this sort of pertubated Hamiltonain Cycle.