Stephen B. Gregg, B. Hopkins, Kristi Karber, Thomas Milligan, Johnny Sharp
{"title":"河内k塔拼图的几个边界","authors":"Stephen B. Gregg, B. Hopkins, Kristi Karber, Thomas Milligan, Johnny Sharp","doi":"10.1515/rmm-2017-0015","DOIUrl":null,"url":null,"abstract":"Abstract We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.","PeriodicalId":120489,"journal":{"name":"Recreational Mathematics Magazine","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Several Bounds for the K-Tower of Hanoi Puzzle\",\"authors\":\"Stephen B. Gregg, B. Hopkins, Kristi Karber, Thomas Milligan, Johnny Sharp\",\"doi\":\"10.1515/rmm-2017-0015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.\",\"PeriodicalId\":120489,\"journal\":{\"name\":\"Recreational Mathematics Magazine\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Recreational Mathematics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/rmm-2017-0015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Recreational Mathematics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/rmm-2017-0015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Abstract We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
