"knight's tour" Meghatározása és Jelentése

a mathematical problem and a chess puzzle that involves finding a sequence of moves for a knight that visits every square on an empty chessboard exactly once