A measure of complexity is proposed that counts the number of local minima in any given problem representation. A special class of functions with the maximum possible number of optima is also defined. A proof is given showing that reflected Gray code induce more optima than Binary over this special class of functions; by the No Free Lunch principle, reflected Gray codes therefore induces fewer optima over all other remaining functions.
展开▼
