In this article the possibility of saving evaluations during the running of the genetic algorithm is investigated. The study begins with the presentation of the concept on inheritance, already proposed in literature. The article develops further this idea with the addition of the concept of confidence, enabling the possibility of new schemes of inheritance, such as dynamic ones. The intuition of this enhancement is mathematically explored. The performance of the new schemes is compared via experimentation, leading to some interesting results.