Heuristic search for Hamilton cycles in cubic graphs

A successful heuristic algorithm for finding Hamilton cycles in cubic graphs is described. Several graphs from The Foster Census of connected symmetric trivalent graphs   and all cubic Cayley graphs of the group PSL2(7)PSL2(7) are shown to be Hamiltonian.