For the following investigation, return TRIALS_PER_TEST back to 11 in the interest of your own time. Keeping an increased number of trials may change the results you obtain, but the same learning outcomes will still be achieved if I crafted larger (more difficult) problem instances for you to solve which would just take you longer to complete.

In the implementations of DBHC and SDHC, you were asked to accept a neighbouring solution if that solution strictly improves over the current solution. Try changing this to accept all non-worsening neighbouring solutions and run some further experiments. What conclusions can you draw about the performance of the hill-climbing algorithms when using the different acceptance mechanisms?