Question 3C - Treasure Hunters
- Problem Sheet
- I do not have a good solution for this problem. This is a hard question. If you don't believe me you should actually try running your problem with the full 100x8x6 data set that the question actually covers. The bottom line is that you will need to have a searching algorithm that is heavily pruned, but is still able to avoid the problem of "local maxima" (a real concern with this kind of problem).
- Sample Solution (incomplete) [input=>output]