T. Benoist, How many edges can be shared by N square tiles on a board? E-lab research report, 2008.

J. Gaschnig, Performance measurement and analysis of certain search algorithms, 1979.

M. L. Ginsberg, Dynamic backtracking, Journal of AI Research, vol.1, pp.25-46, 1993.
DOI : 10.1007/3-540-58601-6_105

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

G. Harris, A CSP View of Eternity 2. On http://games.groups.yahoo.com/group, 2008.

F. Laburthe, CHOCO: implementing a CP kernel, CP00 Post Conference Workshop on Techniques for Implementing Constraint programming Systems (TRICS), 2000.

A. K. Mackworth, Constraint Satisfaction, in Encyclopedia of AI, pp.205-211, 1988.

U. Montanari, Networks of constraints:Fundamental properties and application to picture processing, Information Science, vol.7, 1974.

A. Lopez-ortiz, C. Quimper, J. Tromp, and P. Van-beek, A Fast and Simple Algorithm for Bounds Consistency of the Alldifferent Constraint, Proceedings of IJCAI'2003

J. Régin, A filtering algorithm for constraints of difference in CSPs, AAAI 94 Twelth National Conference on Artificial Intelligence, pp.362-367, 1994.

P. Schaus and Y. Deville, Hybridation de la programmation par contraintes et d'un voisinage à très grande taille pour Eternity II, Dans JFPC 2008-Quatrièmes Journées Francophones de Programmation par Contraintes, pp.115-122, 2008.

P. Torres and . Lopez, Overview and possible extensions of shaving techniques for job-shop problems, 2nd International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, pp.181-186, 2000.

Y. Takenaga and T. Walsh, Tetravex is NP-complete, Information Processing Letters, vol.99, issue.5, 2006.
DOI : 10.1016/j.ipl.2006.04.010