28 Another puzzle Solution (suggested): number the squares make a graph model of the night moves find if a knight can visit all the points, each exactly once, and finish in the starting point: 12, 4, 10, 11, 5, 7, 1, 9, 3, 2, 8, 6, 12 This version of the puzzle appears to be much easier Concepts: graph models algorithm Hamiltonian graphs Maciej M.
{}