A Dynamic Programming Based Solution to the Two-Dimensional Jump-It Problem

ABSTRACT

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.

References

1. Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. 2009. Introduction to Algorithms, 3rd ed., Cambridge, MA: MIT Press, 2009.
2. Jon Kleinberg and Eva Tardos. 2005. Algorithm Design, Boston, MA: Pearson, 2005.
3. Jamil Saquer and Lloyd Smith. 2016. Simplifying dynamic programming, In Proceedings of the 5th International Conference on Informatics and Applications, Takamatsu, Japan, 159--164.
4. Jamil Saquer and Razib Iqbal. 2017. A Python source code for finding an optimal path for the 2D JumpIt problem. {online} http://people.missouristate.edu/riqbal/algorithms/