《雷夫的谜题》是关于神的规则的单一放松

Journal of Bangladesh Academy of Sciences Pub Date : 2022-12-31 DOI:10.3329/jbas.v46i2.60444

A. Majumdar

{"title":"《雷夫的谜题》是关于神的规则的单一放松","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":"{\"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}","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

摘要

本文提出了雷夫谜题的一个新版本，最多只允许违反一次“神圣规则”。设S(n)为求解n(³1)个圆盘问题所需的最小步数，给出了求解S(n)所满足的动态规划方程的方案。导出了S(n)的封闭表达式。科学通报46(2);2022年12月213-217日

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The Reve’s Puzzle with single relaxation of the Divine rule

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Bangladesh Academy of Sciences

自引率

0.00%

发文量