- Find a path in a graph that visits every vertex - Reduces to the [[Hamiltonian Cycle]] - Rudratra was a Kashmiri poet in East Prussia - he wondered if you could visit all squares of chessboard w/o repeating any square, in one long walk that ends at the starting square