So I have the following problem : a X by Y grid. On the grid there is a character and a monster and some items that give bonus points to the character's damage if picked and holes that must be avoided. The goal is to collect enough items to be able to defeat the monster, then navigate to the monster and fight it. What king of algorithm can be used to solve this problem ? Collecting items seems pretty closed to a bin packing type problem, but how about navigation ?