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

被引：0
|
作者：
Saquer, Jamil [1 ]
Iqbal, Razib [1 ]
机构：
[1] Missouri State Univ, Dept Comp Sci, Springfield, MO 65897 USA
来源：
PROCEEDINGS OF THE SOUTHEAST CONFERENCE ACM SE'17 | 2017年
关键词：
Dynamic programming; game optimization; recursion;
D O I：
10.1145/3077286.3077290
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：219 / 222
页数：4
相关论文
共 50 条
12345