Solution Numbers for Eight Blocks to Madness Puzzle
Inga Johnson, Erika Roldan

TL;DR
This paper investigates the solution counts and configurations for a puzzle involving MacMahon cubes, analyzing how collections of these cubes can be assembled into larger target cubes and identifying universal sets capable of constructing all 30 cube types.
Contribution
It provides a detailed enumeration of solutions for the 2x2x2 MacMahon cube puzzle, characterizes collections that can build multiple target cubes, and introduces nine new Minimum Universal sets.
Findings
Exactly two solutions for the specific 8-cube arrangement.
Maximum of five target cubes can be built from a collection of eight.
Identified nine new Minimum Universal sets of twelve cubes.
Abstract
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 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 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 puzzle and the number of distinct solutions attainable for a collection of eight cubes. Additionally, given a collection of eight MacMahon…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · History and Theory of Mathematics
