- You have a 10 by 10 grid.
- You can start at any spot on the grid.
- You must land at each space exactly once.
- you can move 8 directions. The first 4 our up, down, left, and right exactly parallel and perpendicular to the x and y axis of the graph. On those moves you skip 2 spaces, landing in the third space. The other 4 moves are offset 45 degrees from the previous 4 skipping 1 square while moving sideways.
Join GitHub today
GitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up
A Hamiltonian Path Solver
Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Type||Name||Latest commit message||Commit time|
|Failed to load latest commit information.|