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.

Department(s)

Computer Science

Document Type

Conference Proceeding

DOI

https://doi.org/10.1145/3077286.3077290

Keywords

Dynamic programming, Game optimization, Recursion

Publication Date

4-13-2017

Journal Title

Proceedings of the SouthEast Conference, ACMSE 2017

Link to Full Text

Share

COinS