Did you solve it? Hamiltonian ingenuity on the grid

The solutions to today's puzzles

Earlier today I set you two puzzles based on Hamiltonian paths in a square grid. A Hamiltonian path is one which visits every cell exactly once. (If you want a print out of the puzzles, click here.)

1. The Hamiltonian path