N. Beldiceanu and E. Contejean, Introducing Global Constraints in CHIP, Mathematical Computation Modelling, pp.97-123, 1994.

]. A. Con94, T. Conrad, H. Hindricks, I. Morsy, and . Wegener, Solution of the knight's hamiltonien path problem on chessboards, Discrete Applied Mathematics, vol.50, pp.125-134, 1994.

M. Dincbas, P. Van-hentenryck, H. Simonis, A. Aggoun, T. Graf et al., The Constraint Logic Programming Language CHIP, proceeding of the International Conference on Fifth Generation Computer Systems (FGCS'88), pp.693-702, 1988.

]. H. Dud70 and . Dudeney, Amusements in mathematics, Dover publications inc, 1970.

]. Lau76 and . Laurière, Un langage et un programme pour énoncer et résoudre des problèmes combinatoires, Thèse d'état PARIS VI, 1976.

]. A. Sch91 and . Schwenk, Which rectangular chessboards have a knight's tour?, Mathematical Magazine, vol.64, issue.5, pp.325-333, 1991.

]. J. Shu94, H. J. Shufet, and . Berliner, Generating hamiltonien circuits without backtracking from errors, Theoretical Computer Sciences, vol.132, pp.347-375, 1994.

H. Simonis, Standard Models 2 for Finite Domain Constraint Solving

]. A. Van1771 and . Vandermonde, Remarques sur les problèmes de situation, Mémoires de l'Académie des Sciences de Paris, 1771.