Symmetric Quintuple Stacks
15×15 · five stacked 15s in rows 6–10 · rotational, mirror or top-bottom symmetry · no 2×2 block

Symmetric quintuple stacks

Can a standard 15×15 grid hold five stacked 15-letter entries across its middle, with symmetric black squares and fair entries everywhere else? One grid shows it can be done by hand. This page shows how close an automatic search gets, and the frames it leaves for a constructor to finish. An exhaustive check now shows that none of the stacks we know can be finished with fair entries alone: a symmetric quintuple needs the kind of license Eric Chaikin took.

Version 35 · updated October 16, 2026

Eric Chaikin’s grid

Eric Chaikin built this by hand on the PRIVATESECURITY stack: 180° rotational symmetry, 32 black squares, no 2×2 block, 66 entries. In his words, he only completed it by allowing bottom-of-the-barrel entries such as the user handle BAHERMO.

Measured against our judged word list, 13 of its entries are outside it, and 6 of those cross the stack: IBEROPHONE, MCLEESELAKE, NINEATATIME, NOUGATED, THECOMET and VTENS. A symmetric quintuple appears to need that kind of constructor’s license, so the search below measures how much license each candidate needs, and how promising the open slots are.

13entries outside our list
6of them cross the stack
7open slots in the best automatic layout of his stack

Can any of them be finished fairly?

No. We ran the second half of the Borgmann search on every stack we know: supply real but unlisted entries, or fair coinages, for exactly the slots where the word lists run out. Each of 20,478 stacks was checked under all three symmetries, 61,434 checks in all, and not one can be finished with fair entries in any layout.

The check is exhaustive, not sampled. For each column through the stack it works out exactly which down lengths the symmetry and the no-2×2 rule allow, above and below the stack, and asks whether one symmetric pattern of black squares lets every column take a length that has a fair entry. That calculation agrees with the layout search on all 12,010 real layouts tested. A fair entry is one judged acceptable or marginal clue-first, or a well-scored list entry. Claude judged about 390 new candidates for this round, from the 21-million-entry frequency database, from run-together phrases of listed entries, and from its own knowledge of the language. Real finds included ABORIGINAL FLAG, TAKE IT IN STRIDE, BERNERS-LEE, ENGINEERED WOOD and STERNER STUFF. None was enough.

61,434stack and symmetry checks
0finishable with fair entries
5one column pair short

The nearest misses each need just one more pair of entries, but at one exact length and offset, and for each pair at least one of the two entries has no fair fill:

StackSymmetryMissing (· = any letter)What we found
IMITATIONOFLIFERotational, mirror····ITLET···· with ····NEFFI····, or other lengthsCOST-INEFFICIENT and INEFFICACY fit the NEFFI side; no fair ITLET entry fits the matching length
ACROPOLISMUSEUMMirrorPOULE with UTENE, any lengthPOULENC fits one side; nothing pairs with it
ULTRAMARATHONERMirror····LLENA·, or ····ERNER·····Partners WESTERNERS and UNFALLEN ANGELS exist; the other sides do not
ULTRAMARATHONERTop-bottom·RSTAT·Nothing fair

So the frames below cannot be completed from fair vocabulary; each needs entries of the kind Eric used, such as BAHERMO or VTENS. His grid is not just a hand-built record: as far as our stacks go, it is the only kind of symmetric quintuple stack there is. The result covers the stacks our searches have found and today’s vocabulary; a stack found later can be screened the same way in under a second.

New since version 31: stacks built for symmetry, judged as they go. The stacks above came from earlier searches that ignored symmetry. So on October 9 we ran two symmetric band searches for 24 hours, building stacks row by row and checking each one as it appeared. The first allowed fair entries only and found no stack at all. The second also allowed unjudged entries from the frequency database and found 12,967 stacks; none can be finished with fair entries.

That second search then ran as a true Borgmann loop from October 10 to October 12. Every ten minutes it re-checked only the stacks a new verdict affected, and Claude judged the waiting entries clue-first once an hour, the stack needing the fewest verdicts first. It ended on October 12 with nothing left to judge: 11,148 verdicts in all, 2,775 accepted, 3,300 marginal, 5,065 junk and 8 that fail the breakfast test. In its last hours the lists ran dry for 70 slot patterns. For each one Claude looked for a real entry or a fair coinage and found none, because every one asks for a run of letters such as DALIE, ENEER, HISNT or NYATA that no fair entry contains.

12,967symmetric stacks found by the band search
78 → 0still finishable if their unjudged entries pass
0finishable with fair entries

Judging ruled the stacks out one by one, because one junk verdict on an entry a stack cannot do without is enough. The closest stack in version 32, MORTGAGEPAYMENT / ATHLETICAPPAREL / THEIRONTRIANGLE / TRANSPARENTNESS / HERECOMESTHESUN, was ruled out too, and the last of the 78 fell on the morning of October 12. Along the way five stacks did pass the exact check of their crossings with fair entries, the last of them the top-bottom NONTOTALITARIAN / INTERPRETATIONS / STARTLERESPONSE / CAFEDESARTISTES / ITALIANPAINTERS. At the time the loop reported that none of the five had a symmetric layout of black squares without a license; version 35 found that report was wrong, and the section below has the corrected result. The loop’s answer is the same as version 31’s: none of the 12,967 symmetric stacks can be finished with fair entries.

New in version 35: Eric’s scores calibrate the judge. Eric has sent two files of 167 entries, each scored from 0 to 100 for how firmly it is in the language, with 50 as the line and a confidence for each score. Version 34 used his first file as binding verdicts on those 167 entries. That was the wrong use. His scores exist to calibrate Claude’s own sense of English, so that its verdicts on the many thousands of entries he will never see land where he would put them. His scores are no longer written into the verdict cache at all.

The calibration is done blind, so it can be measured honestly. His 167 entries, from his second file, were split at random into two halves. A fresh Claude context that had never seen his scores scored every entry. Correction notes were written from the first half only. A second fresh context then scored the held-out half with the notes, and only the count of agreements was looked at. Nobody inspected the held-out half itself.

67% → 71%agreement with Eric’s in/out line on the held-out half, before and after the notes
25 → 11average gap from his score, in points on his 0–100 scale
+0.59rank correlation with his scores, unchanged by the notes

The notes mostly fixed the scale. Eric keeps borderline entries between about 40 and 60, while the uncalibrated scorer spread them from 5 to 85. They did little for which side of the line an entry falls on: the gain from 67% to 71% is three entries out of 83, within chance. The scorer’s errors are about kinds of word. It accepted recent internet coinages such as SNOWCLONE and SEALIONING, which Eric puts just out, and specialist foreign terms such as IJTIHAD. It rejected real entries that only look strange, such as ARCVERSINE and DEFENESTRABLE, which he puts just in. A separate blind pass by the 9×9 search came out almost the same as this one: the two passes agree closely with each other and much less with Eric. So the bias belongs to the model, not to one session, and only an outside expert like Eric can correct it. Measuring a real improvement will need more scored entries from him.

The five stacks, checked again. Five stacks pass the exact check of their crossings, and version 34 reported that none of them had a symmetric layout. Two faults in the search caused that report. The layout step never wrote its layouts to disk, so three of the five had layouts that were never tried. The fill also refused any of a stack’s own rows that had never been judged and scored below 60 on the word list. With both fixed, each of the five was laid out again with up to four columns allowed to run through the stack with no listed word. Every stack row was then judged with the calibrated standard.

The answer stands: none of the 12,967 symmetric stacks can be finished with fair entries.

Frames to finish by hand

Ten frames, one per stack, ranked by the fertility of their weakest open slot; each needs four or five entries supplied, and as shown above, at least one of them must come from beyond fair vocabulary. Each is filled from the judged list except the open slots. Inside an open slot only the stack letters are fixed; the other letters shown come from the crossing entries and can change with them. Each open slot needs an entry of exactly the length shown. Under each slot: its segment, how many real entries contain it, and a few of them as raw material.

the stackopen slot: an entry to supply

How the frames were made

The layout search places black squares column by column under the chosen symmetry with no 2×2 block; the license lets a few columns take a down slot no listed word fits. A second pass finds every slot such a layout leaves open, fills the rest of the grid from the judged list (a scored crossword list minus every entry judged junk), and scores each open slot’s segment. This is the first half of what we call a Borgmann search: find the exact slots where the word lists run out. The second half, supplying a real but unlisted entry or a fair coinage for each slot, is described in the section above: done exhaustively, it shows that no stack we know has a fair symmetric finish.