How can i find the Hamiltonian cycle on an nxn grid that uses the least amount of stright lines (curves left/right as much as possible)? Here's an example we have devised for 8x8: Here is an example we have devised for a 6x6: And can this be applied to a grid of any dimensions (apart from non-hamiltonian grids)?

Finding the Hamiltonian cycle that uses the least amount of straight lines

Computer Science Asked by Tzlil on January 30, 2021

How can i find the Hamiltonian cycle on an nxn grid that uses the least amount of stright lines (curves left/right as much as possible)?

Here’s an example we have devised for 8×8:

Here is an example we have devised for a 6×6:

And can this be applied to a grid of any dimensions (apart from non-hamiltonian grids)?

Get help from others!