Hey, as far as I understood it the No free lunch theorem states that for all possible search problems all search algorithm will behave equally good on average.
I have problems believing this: For example: can't we show that A* is an optimal search algorithm while Greedy search is not? Hence for all search problems A* will find an optimal solution while Greedy search doesnt. So on average A* will be better than Greedy Search for all possible Search problems.
Pls help :)
[link][comment]