Dominoes in a square · n = 32
Pack n 1 × 2 dominoes into a square. Contact is allowed; interiors cannot overlap. Minimise the container square side.
Formal definition
- ContainerThe editor and certificate normalize to the unit square [0,1]². This is a coordinate convention only; scores use the literature's unit-piece scale. Boundary contact is allowed.
- SubmissionSubmit {radius, placements:[{x,y,turn,quarter},…]}, with x, y and turn as decimal strings of at most nine places. radius is the piece's short side (the leg, the domino's short side, the cell side); the container side is 1/radius. x,y is the centre of the piece's bounding box; quarter is an integer 0–3, an exact number of right angles applied about the centre before the rational turn = tan(θ/2). Coordinates and turn lie in ±4; 0 < radius ≤ 4.
- ConstraintsExactly n congruent shapes lie wholly in the container with pairwise disjoint interiors. Polygon rotations are independent, not limited to quarter turns.
- PrecisionInput decimals are exact rationals; regular-polygon vertices are algebraic, not rounded templates. Feasibility has no floating-point tolerance. A finite-decimal certificate is not a continuous optimality proof.
- Objectivecontainer square side = 1/r (r is the piece's short side inside the unit square), smaller is better. Pages, leaderboards and literature records share this unit; nothing is converted by hand.