An analysis of the (colored cubes)(3) puzzle

Downloadable Content

Download this item
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 n(3) cubes colored in this manner. When is it possible to assemble these cubes into an n x n x 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 x 2 x 2 case we give necessary and sufficient conditions for a set of eight cubes to have a solution. Furthermore, we show that the (colored cubes)3 puzzle always has a solution for n > 2.
TitleAn analysis of the (colored cubes)(3) puzzle
CreatorBerkove, Ethan
Kogut, J.
Van Sickle, J.
Hummone, B.
PublisherDiscrete Mathematics
Academic DepartmentMathematics
DivisionNatural Sciences
OrganizationLafayette College
Date Issued2008
Date Available2019-01-04T21:50:31Z
TypeArticle
LanguageEnglish
KeywordInstant Insanity
Bibliographic CitationBerkove, E., et al. (2008) "An analysis of the (colored cubes)(3) puzzle." Discrete Mathematics 308 (7): 1033-1045.
Standard IdentifierHandle 10385/2542
DOI 10.1016/j.disc.2007.03.058
Permalinkhttp://hdl.handle.net/10385/2542
Rights Statement In Copyright In Copyright
Rights HoldersElsevier B.V.
Contains
File Berkove-DiscreteMathematics-vol308-2008.pdf Uploaded 2019-10-20 Public Download

Member of Collection

Faculty Publications

View Collection