Question: a) Show that finding a knight's tour on an m × n chessboard is equivalent to finding a Hamilton path on the graph representing the legal moves of a knight on that board.
b) Show that finding a reentrant knight's tour on an m × n chessboard is equivalent to finding a Hamilton circuit on the corresponding graph.