3.7.96. Euler knight

Denotes the fact that a constraint can be used for modelling some parts of the Euler knight problem. The Euler knight problem consists of finding a sequence of moves on a chessboard by a knight such that each square of the board is visited exactly once.