Hamiltonian path/cycle

Construct a cycle visiting each vertex exactly once.

Construct a cycle visiting each vertex exactly once.

Construct a path visiting each vertex exactly once.

These interactive puzzles are part of two specializations at Coursera: Introduction to Discrete Mathematics for Computer Science and Data Structures and Algorithms. They provide you with a fun way to "invent" the key ideas on your own! Even if you fail to solve some puzzles, the time will not be lost as you will better appreciate the beauty and power of the underlying ideas. Besides more than 50 such puzzles, the specializations contain more than 100 programming challenges. We encourage you to sign up for a session and learn this material while interacting with thousands of other talented students from around the world.