Solution: Dungeon Game
Let's solve the Dungeon Game problem using the Dynamic Programming pattern.
We'll cover the following...
Statement
A group of demons has captured a princess and locked her in the bottom-right corner of a dungeon. The dungeon is represented as a 2D grid of size
The knight, starting in the top-left corner of the grid, must travel through the dungeon to rescue the princess.
He can move only to the right or downward at each step.
If a cell contains a negative integer, it represents a demon that decreases the knight’s health.
If a cell contains zero, it is an empty room with no effect.
If a cell contains a positive integer, it represents a magic orb that increases the knight’s health.
The knight begins his journey with an initial health point (HP) represented by a ...