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!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP