ABSTRACT
This chapter presents mathematical puzzles that can be tackled by integer linear programming (ILP). They are the Sudoku puzzle, a river crossing puzzle, and a lattice puzzle. The ILP formulations and solutions by GLPK are presented. For the river crossing puzzle, the shortest path approach is also introduced to solve the problem.
