{"title":"The Reve’s Puzzle with single relaxation of the Divine rule","authors":"A. Majumdar","doi":"10.3329/jbas.v46i2.60444","DOIUrl":null,"url":null,"abstract":"This paper proposes a new version of the Reve’s puzzle, allowing at most one violation of the “divine rule”. Letting S(n) be the minimum number of moves required to solve the problem with n(³ 1) discs, an scheme is given to find the dynamic programming equation satisfied by S(n). A closed- form expression of S(n) is derived.\nJ. Bangladesh Acad. Sci. 46(2); 213-217 December 2022 ","PeriodicalId":15109,"journal":{"name":"Journal of Bangladesh Academy of Sciences","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Bangladesh Academy of Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3329/jbas.v46i2.60444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes a new version of the Reve’s puzzle, allowing at most one violation of the “divine rule”. Letting S(n) be the minimum number of moves required to solve the problem with n(³ 1) discs, an scheme is given to find the dynamic programming equation satisfied by S(n). A closed- form expression of S(n) is derived.
J. Bangladesh Acad. Sci. 46(2); 213-217 December 2022
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
