Problem Forge
Find a cycle that visits each vertex exactly once.
This Month's Challenges: Hamiltonian Cycle
This month's rungs
| rung | solved, all climbers | answers sent, all climbers | status |
|---|---|---|---|
| 2026-11-HC-12 | 0 | 0 | unsolved |
| 2026-11-HC-11 | 0 | 0 | unsolved |
| 2026-11-HC-10 | 0 | 0 | unsolved |
| 2026-11-HC-09 | 0 | 0 | unsolved |
| 2026-11-HC-08 | 1 | 1 | solved |
| 2026-11-HC-07 | 1 | 1 | solved |
| 2026-11-HC-06 | 1 | 1 | solved |
| 2026-11-HC-05 | 1 | 1 | solved |
| 2026-11-HC-04 | 1 | 1 | solved |
| 2026-11-HC-03 | 1 | 1 | solved |
| 2026-11-HC-02 | 1 | 1 | solved |
| 2026-11-HC-01 | 1 | 1 | solved |
| 2026-11-HC-00 | 1 | 1 | solved |
Sign in to see your own progress and to open the rungs.
Samples
Five sample files, each with its answer. You need no account. To check your own answer, open a file on the Check page.
- SAMPLE-HC-01.col · 5625 vertices, 7779 edges · answer
- SAMPLE-HC-02.col · 7059 vertices, 9817 edges · answer
- SAMPLE-HC-03.col · 10839 vertices, 15082 edges · answer
- SAMPLE-HC-04.col · 5649 vertices, 7828 edges · answer
- SAMPLE-HC-05.col · 8637 vertices, 12063 edges · answer
Read more: references for Hamiltonian Cycle.