I will be working on a project soon and as I'm clearly not a star (see what I did?) in CS, I'm not sure what to think about this.
To put it simply, the problem is the following:
- We want to go from point A to point B, nice and simple, we can easily find the shortest path.
- Each cell on our grid has a certain value, let's say we win some money by going through cells. So we do not want the shortest path but the most profitable one.
- But, we have a step limitation (known to be at least sufficient to make it from A to B). So we cannot just go on every cell, we have to find an optimized path.
1, 2 and 3 represent cell values, the step limit is arbitrary but you get the idea.
The problem is: How to find the most valuable path we can take, and still make it to point B ?
Any thoughts on this?