A common math problem involves dividing a cube into regular and irregular tetrahedra, where the points of the cube must also be the points of the tetrahedra. A problem I'm working on seems to be going the other way, i.e., "How many unique ways are there to arrange (regular and irregular) tetrahedra within a cube?"
EDIT: It is not necessary to fill the cube, each partially filled cube counts as an arrangement.
First, I would need to find how many ways there are to produce a unique tetrahedron within a cube such that the 4 points of the tetrahedron are 4 of the 8 points of the cube.
Next, for each case of number 1, I would need to find out how many ways there are to fit an additional tetrahedron without overlapping.
Next, for each case of number 2, I would need to fit one additional,
And another,
And one more time.
At this point I believe there is only on possible addition for each remaining case before the cube is full.
I've played with this problem for a while, but am having trouble coming up with a systematic approach to ensure my solution is complete. Any advice?