In 1960, Ore found a simple sufficient condition for a graph to have a
Hamiltonian cycle. We expose a heuristic algorithm, hidden in Ore's p
roof, which can be very effective in actually finding such a cycle. Th
is algorithm is always reasonably efficient and suggests an easy proof
that almost all graphs are Hamiltonian.