4
$\begingroup$

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?

$\endgroup$
4
$\begingroup$

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:

https://news.ycombinator.com/item?id=14472537

$\endgroup$
  • $\begingroup$ It looks like it's the one.Thanks! $\endgroup$ – user394536 Dec 10 '19 at 14:59

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.