HereBoy is an evolutionary algorithm that combines features from Genetic Algorithms and Simulated Annealing, and adds a new methodology for exploring the search space. It is particularly well suited for exploring large spaces, like those associated with evolvable hardware, although it can be applied to a wide range of search/optimization problems. Experimental data consistently shows that when compared to both Genetic Algorithms and Simulated Annealing, HereBoy requires up to 100X fewer iterations than a Genetic Algorithm and up to 10X fewer iterations than Simulated Annealing. In some cases, HereBoy is able to solve problems to a degree of accuracy that a Genetic Algorithm is unable to achieve. HereBoy also scales from small problems to larger problems significantly better than the other two algorithms.