{"title":"基于动态规划的二维跳变问题求解方法","authors":"Jamil Saquer, Razib Iqbal","doi":"10.1145/3077286.3077290","DOIUrl":null,"url":null,"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.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Dynamic Programming Based Solution to the Two-Dimensional Jump-It Problem\",\"authors\":\"Jamil Saquer, Razib Iqbal\",\"doi\":\"10.1145/3077286.3077290\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":91384,\"journal\":{\"name\":\"Proceedings of the 2014 ACM Southeast Regional Conference\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2014 ACM Southeast Regional Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3077286.3077290\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2014 ACM Southeast Regional Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3077286.3077290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
