  The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycle
problem, is introduced. This set is the first to contain instances of
Hamiltonian cycle problem for which the primary difficulty is the underlying
graph structure, rather than simply size. A summary of the kinds of graphs
contained in the FHCP Challenge Set is given. A discussion of the results of
the FHCP Challenge, a year-long competition to solve all instances of the FHCP
Challenge Set first announced at the 59th Annual Meeting for the Australian
Mathematical Society, is also included.
