. In the last twenty years, many algorithms and heuristics were developed to find solutions in constraint networks. Their number increased to such an extent that it quickly became necessary to compare their performances in order to propose a small number of "good" methods. These comparisons often led us to consider FC or FC-CBJ associated with a "minimum domain" variable ordering heuristic as the best techniques to solve a wide variety of constraint networks. In this paper, we first try to convince once and for all the CSP community that MAC is not only more efficient than FC to solve large practical problems, but it is also really more efficient than FC on hard and large random problems. Afterwards, we introduce an original and efficient way to combine variable ordering heuristics. Finally, we conjecture that when a good variable ordering heuristic is used, CBJ becomes an expensive gadget which almost always slows down the search, even if it saves a few constraint checks. 1 Introducti...