Start with a collection of cubes and a palette of six colors. We paint the cubes so that each cube face is one color, and all six colors appear on every cube. Take n3 cubes colored in this manner. When is it possible to assemble these cubes into an n×n×n large cube so that each face on the large cube is one color, and all six colors appear on the cube faces? For the 2×2×2 case we give necessary and sufficient conditions for a set of eight cubes to have a solution. Furthermore, we show that the (coloredcubes)3 puzzle always has a solution for n>2.
Beschreibung
An analysis of the (coloredcubes)3 puzzle - ScienceDirect
%0 Journal Article
%1 berkove2008analysis
%A Berkove, Ethan
%A Sickle, Jenna Van
%A Hummon, Ben
%A Kogut, Joy
%D 2008
%J Discrete Mathematics
%K cube macmahon math puzzle
%N 7
%P 1033-1045
%R https://doi.org/10.1016/j.disc.2007.03.058
%T An analysis of the (coloredcubes)3 puzzle
%U https://www.sciencedirect.com/science/article/pii/S0012365X07001641
%V 308
%X Start with a collection of cubes and a palette of six colors. We paint the cubes so that each cube face is one color, and all six colors appear on every cube. Take n3 cubes colored in this manner. When is it possible to assemble these cubes into an n×n×n large cube so that each face on the large cube is one color, and all six colors appear on the cube faces? For the 2×2×2 case we give necessary and sufficient conditions for a set of eight cubes to have a solution. Furthermore, we show that the (coloredcubes)3 puzzle always has a solution for n>2.
@article{berkove2008analysis,
abstract = {Start with a collection of cubes and a palette of six colors. We paint the cubes so that each cube face is one color, and all six colors appear on every cube. Take n3 cubes colored in this manner. When is it possible to assemble these cubes into an n×n×n large cube so that each face on the large cube is one color, and all six colors appear on the cube faces? For the 2×2×2 case we give necessary and sufficient conditions for a set of eight cubes to have a solution. Furthermore, we show that the (coloredcubes)3 puzzle always has a solution for n>2.},
added-at = {2022-12-27T20:16:21.000+0100},
author = {Berkove, Ethan and Sickle, Jenna Van and Hummon, Ben and Kogut, Joy},
biburl = {https://www.bibsonomy.org/bibtex/20a943d8f62ee514584a205dd6983aa7d/jaeschke},
description = {An analysis of the (coloredcubes)3 puzzle - ScienceDirect},
doi = {https://doi.org/10.1016/j.disc.2007.03.058},
interhash = {9a7c06b756b83b3d439f06138c85c02e},
intrahash = {0a943d8f62ee514584a205dd6983aa7d},
issn = {0012-365X},
journal = {Discrete Mathematics},
keywords = {cube macmahon math puzzle},
number = 7,
pages = {1033-1045},
timestamp = {2022-12-27T20:16:21.000+0100},
title = {An analysis of the (coloredcubes)3 puzzle},
url = {https://www.sciencedirect.com/science/article/pii/S0012365X07001641},
volume = 308,
year = 2008
}