八块疯狂拼图的解题编号

Inga Johnson, Erika Roldan
{"title":"八块疯狂拼图的解题编号","authors":"Inga Johnson, Erika Roldan","doi":"arxiv-2407.13208","DOIUrl":null,"url":null,"abstract":"The 30 MacMahon colored cubes have each face painted with one of six colors\nand every color appears on at least one face. One puzzle involving these cubes\nis to create a $2\\times2\\times2$ model with eight distinct MacMahon cubes to\nrecreate a larger version with the external coloring of a specified target\ncube, also a MacMahon cube, and touching interior faces are the same color.\nJ.H. Conway is credited with arranging the cubes in a $6\\times6$ tableau that\ngives a solution to this puzzle. In fact, the particular set of eight cubes\nthat solves this puzzle can be arranged in exactly \\textit{two} distinct ways\nto solve the puzzle. We study a less restrictive puzzle without requiring\ninterior face matching. We describe solutions to the $2\\times2\\times2$ puzzle\nand the number of distinct solutions attainable for a collection of eight\ncubes. Additionally, given a collection of eight MacMahon cubes, we study the\nnumber of target cubes that can be built in a $2\\times2\\times2$ model. We\ncalculate the distribution of the number of cubes that can be built over all\ncollections of eight cubes (the maximum number is five) and provide a complete\ncharacterization of the collections that can build five distinct cubes.\nFurthermore, we identify nine new sets of twelve cubes, called Minimum\nUniversal sets, from which all 30 cubes can be built.","PeriodicalId":501462,"journal":{"name":"arXiv - MATH - History and Overview","volume":"37 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solution Numbers for Eight Blocks to Madness Puzzle\",\"authors\":\"Inga Johnson, Erika Roldan\",\"doi\":\"arxiv-2407.13208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The 30 MacMahon colored cubes have each face painted with one of six colors\\nand every color appears on at least one face. One puzzle involving these cubes\\nis to create a $2\\\\times2\\\\times2$ model with eight distinct MacMahon cubes to\\nrecreate a larger version with the external coloring of a specified target\\ncube, also a MacMahon cube, and touching interior faces are the same color.\\nJ.H. Conway is credited with arranging the cubes in a $6\\\\times6$ tableau that\\ngives a solution to this puzzle. In fact, the particular set of eight cubes\\nthat solves this puzzle can be arranged in exactly \\\\textit{two} distinct ways\\nto solve the puzzle. We study a less restrictive puzzle without requiring\\ninterior face matching. We describe solutions to the $2\\\\times2\\\\times2$ puzzle\\nand the number of distinct solutions attainable for a collection of eight\\ncubes. Additionally, given a collection of eight MacMahon cubes, we study the\\nnumber of target cubes that can be built in a $2\\\\times2\\\\times2$ model. We\\ncalculate the distribution of the number of cubes that can be built over all\\ncollections of eight cubes (the maximum number is five) and provide a complete\\ncharacterization of the collections that can build five distinct cubes.\\nFurthermore, we identify nine new sets of twelve cubes, called Minimum\\nUniversal sets, from which all 30 cubes can be built.\",\"PeriodicalId\":501462,\"journal\":{\"name\":\"arXiv - MATH - History and Overview\",\"volume\":\"37 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - History and Overview\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.13208\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - History and Overview","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.13208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

30个麦克马洪彩色立方体的每个面都涂有六种颜色中的一种,并且每种颜色都至少出现在一个面上。J.H.康威(J.H. Conway)将这些立方体排列成一个6美元乘以6美元的表格,从而得到了这个谜题的答案。事实上,解出这道谜题的八块立方体的特定集合可以以完全不同的方式排列来解出谜题。我们研究了一个不要求内部面匹配的限制性较小的谜题。我们描述了2乘以2乘以2元谜题的解法,以及八个立方体集合所能得到的不同解法的数量。此外,给定八个麦克马洪立方体的集合,我们研究了在2(times2)(times2)模型中可以构建的目标立方体的数量。我们计算了所有八个立方体集合(最大数目为五个)中可构建的立方体数目的分布,并提供了可构建五个不同立方体的集合的完整特征。此外,我们确定了九个新的十二个立方体集合,称为最小通用集合,从这些集合中可构建所有 30 个立方体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Solution Numbers for Eight Blocks to Madness Puzzle
The 30 MacMahon colored cubes have each face painted with one of six colors and every color appears on at least one face. One puzzle involving these cubes is to create a $2\times2\times2$ model with eight distinct MacMahon cubes to recreate a larger version with the external coloring of a specified target cube, also a MacMahon cube, and touching interior faces are the same color. J.H. Conway is credited with arranging the cubes in a $6\times6$ tableau that gives a solution to this puzzle. In fact, the particular set of eight cubes that solves this puzzle can be arranged in exactly \textit{two} distinct ways to solve the puzzle. We study a less restrictive puzzle without requiring interior face matching. We describe solutions to the $2\times2\times2$ puzzle and the number of distinct solutions attainable for a collection of eight cubes. Additionally, given a collection of eight MacMahon cubes, we study the number of target cubes that can be built in a $2\times2\times2$ model. We calculate the distribution of the number of cubes that can be built over all collections of eight cubes (the maximum number is five) and provide a complete characterization of the collections that can build five distinct cubes. Furthermore, we identify nine new sets of twelve cubes, called Minimum Universal sets, from which all 30 cubes can be built.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信