Phil's math students attempt to find 1 possible solution of the knights tour using his newly laminated table top (installed with the help of Paul '18 and Julia '18) that is designed for dry erase markers.
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open.
The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students.