| # | Outer → Inner | Fit | Source | angle° | dx | dy | clear km |
|---|
Given the real-world boundary of every country, find the longest sequence
A₁ → A₂ → … → Aₙ such that each Aᵢ₊₁ can be placed
fully inside Aᵢ. The only allowed moves are rotation and
translation — no scaling, so every country keeps its true size. Containment is
strict: the inner boundary may not touch the outer one. We enforce this with an inward
buffer, requiring outer.buffer(−1.0 km).contains(inner).
TYPE to hide
dependencies and territories.For each ordered pair we ask: can the inner country be rotated and translated to sit strictly inside the outer one? The solver runs a staged search:
A pair is an edge only if a concrete placement clearing 1.0 km is found. A missing edge is search-dependent, never a proof of impossibility.