P96 · Packing and covering · Classic

Consecutive L shapes in a square

VERIFIED CONSTRUCTIONsquare side 36
n = 10Current record · open

Pack n L shapes with short sides 1, 2, …, n into a square without overlap. Each L consists of three equal squares. Translate and rotate the pieces freely to minimise the container side.

Formal definition

  • ContainerThe closed square [0,side]², with 0 < side ≤ 4096, in units of the smallest L short side.
  • SubmissionPiece k has local vertices (−k,−k), (k,−k), (k,0), (0,0), (0,k), (−k,k). Its translated origin is (x,y).
  • RotationRotation is free, not restricted to multiples of 90°. Exact quarter turns and a rational half-angle parameter encode it. Nine-decimal submissions are a finite-precision version of the continuous problem, not an exact encoding of every real angle. Reflections are congruent to rotations of this L, so no reflection parameter is needed.
  • ConstraintsEach L is decomposed into two interior-disjoint rectangles. Every pair of convex parts is checked with exact rational arithmetic; the concave L is not replaced by its convex hull. Contact is legal, positive-area overlap is rejected.
  • ObjectiveMinimise the square side. The public score is the source table’s s, with no conversion.S=side

Getting a feel for it

Area bound

The total area is 3∑k² = n(n+1)(2n+1)/2, a lower bound on side². It need not be attainable: notches and gaps between large pieces also matter.

Published records

Friedman’s table covers n=1–20, with values and original authors cited. No external record is currently cited for n=21–50; they use ordinary site shelf baselines. Instances n=1 and 2 are proved optimal; the others remain open.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.

Discussion (1) ↓
n1
CURRENT RECORD3
Proven optimum
Record holderFounding benchmark
Solution methodHuman
n2
CURRENT RECORD7
Proven optimum
Record holderFounding benchmark
Solution methodHuman
n3
CURRENT RECORD7best known 7
Matches the best known
Record holder今天
Solution methodHuman
n4
CURRENT RECORD11best known 11
Matches the best known
Record holder今天
Solution methodHuman
n5
CURRENT RECORD14best known 14
Matches the best known
Record holder今天
Solution methodHuman
n6
CURRENT RECORD18best known 18
Matches the best known
Record holderqiboqi
Solution methodHuman
n7
CURRENT RECORD22best known 22
Matches the best known
Record holderqiboqi
Solution methodHuman
n8
CURRENT RECORD26best known 26
Matches the best known
Record holderqiboqi
Solution methodHuman
n9
CURRENT RECORD31best known 31
Matches the best known
Record holderqiboqi
Solution methodHuman
n10
CURRENT RECORD36best known 36
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n11
CURRENT RECORD41best known 41
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n12
CURRENT RECORD46best known 46
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n13
CURRENT RECORD51best known 51
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n14
CURRENT RECORD57best known 57
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n15
CURRENT RECORD63best known 63
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n16
CURRENT RECORD69best known 69
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n17
CURRENT RECORD75best known 75
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n18
CURRENT RECORD82best known 82
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n19
CURRENT RECORD88best known 88
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n20
CURRENT RECORD95best known 95
Matches the best known
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n21
CURRENT RECORD102
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n22
CURRENT RECORD110
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n23
CURRENT RECORD117
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n24
CURRENT RECORD124
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n25
CURRENT RECORD132
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n26
CURRENT RECORD140
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n27
CURRENT RECORD148
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n28
CURRENT RECORD155
Hard
Record holderqiboqi
Solution methodAI · OpenAI: GPT-6 Luna
n29
CURRENT RECORD164
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n30
CURRENT RECORD172
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n31
CURRENT RECORD182
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n32
CURRENT RECORD190
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n33
CURRENT RECORD199
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n34
CURRENT RECORD207
Hard
Record holderqiboqi
Solution methodAI · OpenAI: GPT-6 Luna
n35
CURRENT RECORD217
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n36
CURRENT RECORD226
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n37
CURRENT RECORD234
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n38
CURRENT RECORD244
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n39
CURRENT RECORD254
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n40
CURRENT RECORD263
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n41
CURRENT RECORD274
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n42
CURRENT RECORD284
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n43
CURRENT RECORD294
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n44
CURRENT RECORD303
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n45
CURRENT RECORD314
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n46
CURRENT RECORD324
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n47
CURRENT RECORD334
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n48
CURRENT RECORD345
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n49
CURRENT RECORD356
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n50
CURRENT RECORD366
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol

Data and citation

All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.

GET https://minmaxarena.com/data/consecutive-ells-in-square.json

Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.

GET https://minmaxarena.com/data/editions/2026-10/consecutive-ells-in-square.json
BibTeX (click to copy)
@misc{minmaxarena-consecutive-ells-in-square-2026-10,
  title  = {{Consecutive L shapes in a square} (P96)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/consecutive-ells-in-square.json},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.