A heuristic recombination operator is presented in this paper. This operator intelligently explores the dynastic potential (possible children) of the solutions being recombined, providing the best combination of formae (generalised schemata) that can be constructed without introducing implicit mutation. The applicability of this operator to different kind of representations (orthogonal, separable and non-separable representations) is discussed. The experimental results confirm the appropriateness of this operator to a number of widely-known hard combinatorial problems.