Handling constraints for combinatorial optimization problems is a classic challenge faced by genetic and evolutionary algorithms. This paper explores a naturally inspired genetic repair process to enforce constraints on evolutionary search. Lolle et al. (2005) controversially claim that the model plant Arabidopsis thaliana appears to repair genetic errors using information inherited from ancestors other than the immediate parents [10] (i.e. non-Mendelian inheritance). We adapt this natural template-driven genetic repair process (GeneRepair) to help solve constraint problems. Building upon previous results [6][7][8] this paper explores repair templates that originate across a range of ancestors, between one and many thousands of generations old. The fitness of resulting populations are presented and compared to a benchmark technique using a random repair template [9]. The results show that very ancient (ancestral) repair templates perform best for larger problems, significantly outperforming the benchmark. The impact of background mutation rates on solution quality is also explored. Results suggest that ancestral repair is a good general-purpose constraint handling technique – helping to explain why this strategy might have evolved in nature.