In the previous two questions, we observed that different hill-climbing heuristics can outperform each other depending on the computational budget given. Can we draw the conclusion that Steepest Decent Hill Climbing will always outperform Davis’s Bit Hill Climbing for solving any MAX-SAT problem instance if given enough time?