Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be ideally suited for search with GAs. Surprisingly, many studies have shown that genetic algorithms actually perform worse than random mutation hill-climbing on these landscapes, and several different explanations have been offered to account for these observations. Using a detailed stochastic model of genetic search on R1, we attempt to determine a lower bound for the required number of function evaluations, and then use it to