C. Bessiere and J. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Proceedings of CP'96, pp.61-75, 1996.
DOI : 10.1007/3-540-61551-2_66

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, Proceedings of ECAI'04, pp.146-150, 2004.

D. Cohen, P. Jeavons, C. Jefferson, K. E. Petrie, and B. Smith, Symmetry Definitions for Constraint Satisfaction Problems, Constraints, vol.129, issue.2-3, pp.115-137, 2006.
DOI : 10.1007/s10601-006-8059-8

R. Debruyne and C. Bessiere, Domain filtering consistencies, Journal of Artificial Intelligence Research, vol.14, pp.205-230, 2001.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3

T. Fahle, S. Schamberger, and M. Sellman, Symmetry Breaking, Proceedings of CP'01, pp.93-107, 2001.
DOI : 10.1007/3-540-45578-7_7

F. Focacci and M. Milano, Global Cut Framework for Removing Symmetries, Proceedings of CP'01, pp.77-92, 2001.
DOI : 10.1007/3-540-45578-7_6

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, Proceedings of AAAI'91, pp.227-233, 1991.

R. Greenblatt, D. Eastlake, and S. Crocker, The Greenblatt chess program, Proc. Fall Joint Computer Conference, pp.801-810, 1967.

J. Hoffmann and B. Nebel, The FF planning system : Fast plan generation through heuristic search, Journal of Artificial Intelligence Research, vol.14, pp.253-302, 2001.

C. Lecoutre and F. Hemery, A study of residual supports in arc consistency, Proceedings of IJCAI'07, pp.125-130, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00261267

T. A. Marsland, Computer chess and search, In Encyclopedia of Artificial Intelligence, pp.224-241, 1992.

J. F. Puget, Symmetry Breaking Revisited, Constraints, vol.129, issue.1, pp.23-46, 2005.
DOI : 10.1007/s10601-004-5306-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7112

A. Reinefeld and T. A. Marsland, Enhanced iterative-deepening search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.16, issue.7, pp.701-710, 1994.
DOI : 10.1109/34.297950
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.9438

D. Slate and L. Atkin, Chess 4.5 : The northwestern university chess program, Chess Skill in Man and Machine, pp.82-118, 1977.

V. Vidal, A lookahead strategy for heuristic search planning, Proceedings of ICAPS'04, pp.150-159, 2004.

A. L. Zobrist, A new hashing method with applications for game playing, Computer Sciences Dept., Univ. of Wisconsin. Reprinted in Int. Computer Chess Association Journal, vol.13, issue.2, pp.169-173, 1970.