Archives

---

I have constructed the following puzzle based on a 4x4x4 Eastsheen cube. It is labelled with hexadecimal digits 0,1,2,...,9,A,B,C,D,E,F on each face of each cubbie (I have turned the labels at an angle of 45 degrees to avoid having positional information due to label orientations). The goal of the puzzle is to have each label eaxctly once per face and once per row (in all 3 dimensions). This is the only constraint that must be satisfied. It seems possible that a single puzzle has more than one valid solved configuration, but I have not fund more than one so far. I wrote a computer program which generates the instance to be solved "randomly" and outputs the labelling of a scrambled puzzle. This last step is necessary to avoid knowing the solved configuration which would reduce the puzzle to returning each cubbie to its correct place... The puzzle is really difficult because the solved configuration is not known !!!