A brute force algorithm written in Python to find Hamiltonian cycles in square grids. Being brute force, it can only compute for grids with a side length of up to 4. No machine can compute the 2,958,148,142,320,582,656 graphs that this algorithm demands for even a side length of 6. This project is an exploration of algorithm design, computational complexity, and graph traversal, not optimization.
-
Notifications
You must be signed in to change notification settings - Fork 0
A brute force algorithm written in Python to find Hamiltonian cycles in square grids.
License
suranwarnakulasooriya/Hamiltonian_Cycles
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A brute force algorithm written in Python to find Hamiltonian cycles in square grids.