In the field of heuristic search, it is common practice to apply various domain-dependent ideas that serve to significantly enhance the performance of different algorithms.rnExploiting different types of symmetries, whenever possible, has been one of the most prominent techniques, leading to great improvements both in the running time and in the number of nodes generated. Although these practices lead to some interesting open questions, such as how to compare algorithms if some allow the application of such enhancements but others do not, the truth is that the systems built this way, as opposed to domain-independent techniques that aim at solving any problem in any domain, are the most effective for solving specific problems.
展开▼
