A dynamic programming based solution to the two dimensional Jump-It problem
This paper introduces the two-dimensional Jump-It problem, which is a board playing optimization problem. We present a dynamic programming based solution that finds the optimal cost of playing the game in O(mn), where m and n are the dimensions of the playing board. We also show how the solution can be extended to find a path that leads to playing the game with the optimal cost.
Dynamic programming, Game optimization, Recursion
Saquer, Jamil, and Razib Iqbal. "A Dynamic Programming Based Solution to the Two-Dimensional Jump-It Problem." In Proceedings of the SouthEast Conference, pp. 219-222. 2017.
Proceedings of the SouthEast Conference, ACMSE 2017