东京电梯拼图

Q3 Social Sciences
M. Chlond
{"title":"东京电梯拼图","authors":"M. Chlond","doi":"10.1287/ITED.6.3.55","DOIUrl":null,"url":null,"abstract":"Figure 1 represents an eight-storey building with three elevators. The shaded cells represent those floors at which a particular elevator calls. Notice that all elevators call at both top and bottom floors and four floors in between. It is possible, given this configuration, to travel between any two floors by riding a single elevator. The question is, if each lift called at three floors in between top and bottom, how many lifts would be required such that any two floors are connected by a single elevator?","PeriodicalId":37137,"journal":{"name":"INFORMS Transactions on Education","volume":"6 1","pages":"55-59"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1287/ITED.6.3.55","citationCount":"0","resultStr":"{\"title\":\"A Tokyo Elevator Puzzle\",\"authors\":\"M. Chlond\",\"doi\":\"10.1287/ITED.6.3.55\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Figure 1 represents an eight-storey building with three elevators. The shaded cells represent those floors at which a particular elevator calls. Notice that all elevators call at both top and bottom floors and four floors in between. It is possible, given this configuration, to travel between any two floors by riding a single elevator. The question is, if each lift called at three floors in between top and bottom, how many lifts would be required such that any two floors are connected by a single elevator?\",\"PeriodicalId\":37137,\"journal\":{\"name\":\"INFORMS Transactions on Education\",\"volume\":\"6 1\",\"pages\":\"55-59\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1287/ITED.6.3.55\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"INFORMS Transactions on Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/ITED.6.3.55\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"INFORMS Transactions on Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/ITED.6.3.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 0

摘要

图1表示一个有三部电梯的八层建筑。阴影的单元格代表特定电梯呼叫的楼层。请注意,所有的电梯都在顶层和底层,以及中间的四层。在这种结构下,乘坐一部电梯在任意两层楼之间穿梭是可能的。问题是,如果每台电梯在顶层和底层之间的三层召唤,需要多少部电梯才能使任意两层楼由一台电梯连接?
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Tokyo Elevator Puzzle
Figure 1 represents an eight-storey building with three elevators. The shaded cells represent those floors at which a particular elevator calls. Notice that all elevators call at both top and bottom floors and four floors in between. It is possible, given this configuration, to travel between any two floors by riding a single elevator. The question is, if each lift called at three floors in between top and bottom, how many lifts would be required such that any two floors are connected by a single elevator?
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
INFORMS Transactions on Education
INFORMS Transactions on Education Social Sciences-Education
CiteScore
1.70
自引率
0.00%
发文量
34
审稿时长
52 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信