A friend and I have a disagreement about the number of unique ways to label the faces of a six-sided die with integers from one to six so that each pair of opposing faces sums to seven.
I think the answer is 8 since swapping each pair of opposing faces results in (I think) a different handedness for the two hemi cubes centered on the two faces being swapped, without affecting the other hemi cubes. So I think the problem is represented by the possible independent states of the three opposing pairs, giving $2^3=8$ permutations.
My friend thinks the answer is 2, as he argues that a single swap changes the handedness of the entire die, and that further independent swaps can’t further change the die’s handedness, and thus don’t generate unique states.
Who is right? (Or is neither of us right?)
Your successive face-swapping doesn't produce as many unique labelings as you think. Once you swap faces twice, you are back in the original orientation, as this figure shows:
The large numbers are on the faces, and the small ones are on the hidden faces that they are nearest. Swapping the top/bottom and left/right pairs produces the same labeling as simply rotating 180° around the front-back axis.
So here is another way to go about counting the labelings: Fix a single corner of the cube and consider the three faces incident on that corner:
So there are $6 \times 4 \times 2$ ways to label the cube if it's in a fixed position. Of course, we are allowed to rotate the cube, and labelings of the cube should be considered equivalent if one can be rotated into the other. There are $4!$ rotations of the cube. So the number of distinct labelings modulo rotation is $$ \frac{6 \times 4 \times 2}{4 \times 3 \times 2 \times 1} = 2 $$