Dimensions
Each kind of problem is filed under a dimension: the pieces' dimension, "in" or "on", and the container's dimension. "In" means inside a container. "On" means on a closed surface or boundary, with no container. So polygons in polygons are 2D in 2D, and polygons on the surface of a solid are 2D on 3D.
Each kind has its own problems, a viewer that draws its records, and notes that define it exactly. The board opens every problem. Choose a kind in the Problem set menu of its Problem section, or follow a row's Open on the board link. Then run the optimizer in your browser and submit a better packing.
Each problem below shows two values side by side. The certified value is PolyPack's research record: its packing is proven valid with interval arithmetic, or for 3D on 4D with exact rational arithmetic. A site entry is a packing sent to this site; the server checks it with floating-point arithmetic and a tolerance of 10−9, like every other entry. Entries go through the API. The volunteer client can also work on these problems when its optional mode for the other kinds is turned on.
Exhibit
Records
The records of Flat (2D in 2D) are on the Records page. Those of the other kinds are here.
Without folding, each face holds its pieces on its own. On a solid with F identical regular faces, a no-fold problem with P pieces is the same as packing ⌈P / F⌉ pieces in one face, a 2D in 2D problem. Each no-fold row links to it.
- Certified value
- The research record of the problem. Its packing is proven valid at this size: with interval arithmetic, or for 3D on 4D with exact rational arithmetic. Shown at 6 decimals.
- Status
- Best known; proven optimal, where a published proof covers the problem; or no packing exists, where it is proved that the pieces do not fit. Proven and impossible problems take no entries.
- Lower bound
- No packing of the problem can be smaller. Shown at 6 decimals, with what it rests on.
- Without folding
- 3D on 4D only: the smallest edge when every piece must stay inside one cell, with no folding across the square faces where two cells meet.
- Folding gains
- 3D on 4D only: how much shorter the problem's best edge is than the edge without folding, as a percentage.
- Site best
- The best entry sent to this site, checked by the server's floating-point validator of the kind. Only the leading entry of each problem is kept. Shown at 6 decimals.
- Configuration
- The problem with its packings as JSON, in the kind's own format (see its notes).
- Board
- Opens the problem on the board: its best packing drawn, the optimizer in your browser, and submission of a better packing. A no-fold row of a Platonic solid also links to the 2D in 2D problem it is the same as.