The now defunct IQ Mega Test had a problem which was considered it's 'most difficult' called the Three Cube problem. Does anyone know what it is?
Is it this one?
What is the maximum number of completely bounded volumes that can be formed by three interpenetrating cubes, considering only the surfaces of the cubes as bounds and counting only volumes that are not further subdivided?
Found at this link: