The Hadwiger Problem

From Universal Paperclips Wiki
Jump to: navigation, search
The Hadwiger Problem
150 creat
Cubes within cubes within cubes... (+1 Trust)

The Hadwiger Problem is a project in Stage 1 of Universal Paperclips.

Summary[edit | edit source]

It becomes available when you first reach 150 creativity. This project adds 1 Trust and unlocks the project Hadwiger Clip Diagrams.

Notes[edit | edit source]

In real life, the Hadwiger Problem was proposed by Hugo Hadwiger, and asks "What is the largest number of sub-cubes (not necessarily different) into which a cube cannot be divided by plane cuts?" The answer is 47 (Gardner 1992, pp. 297-298). Note that this is not to be confused with the Hadwiger-Nelson problem of geometric graph theory.

This article is a stub. You can help Universal Paperclips Wiki by expanding it.