Rectangle Construction Lab

Construction Search

Target n: Search iterations:

Ready.

The search uses fast heuristic estimates while exploring constructions. It does not repeatedly solve the exact maximum-clique problem during every mutation.

Exact Analysis

This computes the actual maximum pairwise-intersecting family and maximum pairwise-disjoint family using an exact branch-and-bound maximum-clique algorithm. There is deliberately no n cutoff. A difficult instance may simply take a long time.

Current Construction

r(n)

D · I = ?
√n = —
√(n / log₂ n) = —
r / √n = —
r / √(n / log₂ n) = —

Experimental Graph

best construction found

√n

√(n/log₂ n)

Manual Construction

Drag on empty space to create a rectangle.
Drag a rectangle to move it.
Drag a corner to resize it.
Select a rectangle and press Delete to remove it.

Important: The exact solver is genuinely exact, but maximum clique is NP-hard in general. Therefore "no limit" means there is no artificial rectangle-count cutoff—not that every 100-, 1,000-, or 1,000,000-rectangle instance will finish quickly.