Hamiltonian Path on a Polyhedral Net
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Find the shortest path from the orange point to the light blue point along the thick black edges of the net of a polyhedron. You can jump from one point on the net to another that belongs to the same vertex of the polyhedron. If a shortest path exists, it is a Hamiltonian path.
Contributed by: Izidor Hafner (August 2022)
Open content licensed under CC BY-NC-SA