All decks: every possible silhouette

From the enumeration we got 72,994 distinct (front, side) pairs. We can do a nice analysis on those. Namely, which decks can be formed, so that every pair (with all rotations and reflections) of front and side views are constructable.

First, we construct the distinct silhouettes (under ). It turns out that there are 102 distinct silhouettes, of which only 12 are printed in the Project Cube deck. So pick any subset S of those 102 shapes: when does S form a valid deck — every pair of cards in S, in any rotation, having a strict solution? And what are the largest such subsets?

We can construct a compatibility graph from this, listing all views and drawing an edge between them if there is at least one strict solution between them (for every rotation). As a note, I did not check if a card can be used with a copy of itself. All solutions are on GitHub and this analysis can be added there.

When not all pieces need to be used

Subset-allowed regime (apparently the actual game's rules). 339 compatibility edges out of a possible 5,151. Sixty-three of the 102 silhouettes are isolated — they have no compatible partner at all.

When all pieces need to be used

All-pieces-required regime (a stricter version of the rules). The same 102 silhouettes, but only 285 compatibility edges remain.

The silhouette pair solver uses these graphs' edges as its lookup table — every pair you can draw on the front and side grids is one entry in the subset-allowed graph above.

The three largest cliques (subset-allowed regime)

There are 71 maximal cliques of size ≥ 2 in the subset-allowed graph. The three biggest all have 15 nodes; no clique grows past that.

(Each clique block below also lists a min STRICT number. That's the smallest STRICT count for any pair of cards in the clique, in any orientation. It's the "weakest link": the rarest strict solution you'd ever face if you played with this entire clique as your deck. A min STRICT of 1 means somewhere in the clique there's a card pair with exactly one matching tower.)

Clique 1 (15 cards) min STRICT = 1

card 8
card 14
card 4
card 13
card 6
card 10
card 1,3
card 2
card 15

Clique 2 (15 cards) min STRICT = 1

card 8
card 14
card 4
card 10
card 9,11
card 1,3
card 12
card 2
card 13
card 6
card 15

Clique 3 (15 cards) min STRICT = 1

card 8
card 14
card 4
card 10
card 1,3
card 12
card 2
card 13
card 6
card 15

The all-pieces-required regime

Recompute the same exercise against the stricter graph (the one that requires every tower to use all six pieces, second figure above). The graph has 79 maximal cliques of size ≥ 2 instead of 71, but they're smaller — the largest is now 13 nodes, the next two are 12. Three game-card shapes that were comfortably part of every top-3 subset-allowed clique drop out of the top cliques here: cards 8 (), 10 (), 12 () and 14 () do not appear among the top three anymore.

Clique 1, all-pieces (13 cards) min STRICT = 1

card 4
card 13
card 6
card 1,3
card 2
card 15

Clique 2, all-pieces (12 cards) min STRICT = 1

card 4
card 13
card 6
card 1,3
card 2
card 15

Clique 3, all-pieces (12 cards) min STRICT = 1

card 4
card 13
card 6
card 1,3
card 2
card 15