This is the type of non-obvious optimization that genetic algorithms excel at. This is not true. GA search is a hill climbing algorithm which is prone to finding local maxima. The less obvious a strategy is, the more likely it is that GA will miss it.
> GA search is a hill climbing algorithm which is prone to finding local maxima GAs are not pure hill climbers. Variation operators introduce new solutions into the population at random. As long as premature convergence is prevented, GAs will probably explore the search space well. There's always a tradeoff between exploration and exploitation. > The less obvious a strategy is, the more likely it is that GA will miss…
In searching for non-obvious solutions a GA is no better, probably even worse than an exhaustive search. You are essentially gambling to find the absolute maxima by increasing the mutation rate and population variance. GA is merely a heuristic to speed up searches by assuming the global solution is close to your randomly seeded population, something which is unlikely to be true in non-obvious solutions.
Let's say you increase the mutation rate to the point where you are guaranteed find the "non-obvious solution". Well then you've essentially just created an insanely inefficient exhaustive search.
This is a tautology that states "the harder a problem it is, the harder it is.
No. For example in an exhaustive search, the obviousness of a strategy has no bearing on whether or not it would more likely be found.