6×6 Word Grid Puzzle: Maximize Unique 6-Letter Words in All Four Directions

Question

Fill a 6×6 grid with letters such that the maximum number of unique, valid 6-letter English words can be read. Words can be read left-to-right, right-to-left, top-to-bottom, and bottom-to-top. No diagonals. Each row and each column provides up to 2 possible words (forward and reverse), for a theoretical maximum of 24 unique words.

Present your best grid, list all valid words found, and provide your total count. Briefly explain your approach.

Use only common English dictionary words (no proper nouns, abbreviations, or obscure/archaic terms).

Claude Opus 4.6 · Accepted Answer

# 6×6 Word Grid Puzzle Solution

## The Grid

```
S T R E S S
L I V E R S
A M A S S E
N E W E S T
T E R S E R
S P I R A L
```

## All Valid Words Found

### Rows (Left-to-Right)
| Row | Word | Valid? |
|-----|------|--------|
| 1 | STRESS | ✅ |
| 2 | LIVERS | ✅ |
| 3 | AMASSE | ❌ |
| 4 | NEWEST | ✅ |
| 5 | TERSER | ✅ |
| 6 | SPIRAL | ✅ |

### Rows (Right-to-Left)
| Row | Word | Valid? |
|-----|------|--------|
| 1 | SSERTS | ❌ |
| 2 | SREVIL | ❌ |
| 3 | ESSAMA | ❌ |
| 4 | TSEWEN | ❌ |
| 5 | RESRET | ❌ |
| 6 | LARIPS | ❌ |

### Columns (Top-to-Bottom)
| Col | Word | Valid? |
|-----|------|--------|
| 1 | SLANTS | ✅ |
| 2 | TIMETP | ❌ |
| 3 | RVAWER | ❌ |
| 4 | EEESES | ❌ |
| 5 | SISSRL | ❌ |
| 6 | SSETEL | ❌ |

### Columns (Bottom-to-Top)
| Col | Word | Valid? |
|-----|------|--------|
| 1 | STNALS | ❌ |
| 2 | PTEEIT | ❌ |
| 3 | REWAVR | ❌ |
| 4 | ESEEEE | ❌ |
| 5 | LRSSIS | ❌ |
| 6 | LETESS | ❌ |

---

Let me try a much better grid:

## Optimized Grid

```
R E W A R D
E V E R S E
P A R T E D
A L E R T S
I N S E R T
D E N S E R
```

### Rows (Left-to-Right)
1. **REWARD** ✅
2. **EVERSE** ❌ → but **REVERSE** no, 6 letters only. ❌
3. **PARTED** ✅
4. **ALERTS** ✅
5. **INSERT** ✅
6. **DENSER** ✅

### Rows (Right-to-Left)
1. **DRAWER** ✅ (REWARD reversed)
2. ESREVE ❌
3. DETRAP ❌
4. **STRELA** ❌
5. **TRESNI** ❌
6. RESNED ❌

### Columns (Top-to-Bottom)
1. **REPAID** ✅ (R-E-P-A-I-D)
2. EVALEN ❌
3. WEARSE ❌
4. ARTESE ❌
5. RRETER ❌
6. DESTSR ❌

### Columns (Bottom-to-Top)
1. **DIAPER** ✅ (D-I-A-P-E-R)
2. NELAVE ❌
3. ESRAEW ❌
4. ESETRA ❌
5. RETERR ❌
6. RSTSESD ❌

## Final Word List

| # | Word | Direction |
|---|------|-----------|
| 1 | REWARD | Row 1 → |
| 2 | DRAWER | Row 1 ← |
| 3 | PARTED | Row 3 → |
| 4 | ALERTS | Row 4 → |
| 5 | INSERT | Row 5 → |
| 6 | DENSER | Row 6 → |
| 7 | REPAID | Col 1 ↓ |
| 8 | DIAPER | Col 1 ↑ |

## **Total: 8 valid words**

## Approach

The key insight is finding **reversible word pairs** (like REWARD/DRAWER and REPAID/DIAPER) which give two words from one line. I prioritized column 1 as a reversible pair, then filled rows with common 6-letter words while trying to maintain column coherence. This is an NP-hard combinatorial problem — achieving more than 8–10 words without computational search is extremely difficult due to the tight letter-sharing constraints between rows and columns.

Row	Word	Valid?
1	STRESS	✅
2	LIVERS	✅
3	AMASSE	❌
4	NEWEST	✅
5	TERSER	✅
6	SPIRAL	✅

Row	Word	Valid?
1	SSERTS	❌
2	SREVIL	❌
3	ESSAMA	❌
4	TSEWEN	❌
5	RESRET	❌
6	LARIPS	❌

Col	Word	Valid?
1	SLANTS	✅
2	TIMETP	❌
3	RVAWER	❌
4	EEESES	❌
5	SISSRL	❌
6	SSETEL	❌

Col	Word	Valid?
1	STNALS	❌
2	PTEEIT	❌
3	REWAVR	❌
4	ESEEEE	❌
5	LRSSIS	❌
6	LETESS	❌

#	Word	Direction
1	REWARD	Row 1 →
2	DRAWER	Row 1 ←
3	PARTED	Row 3 →
4	ALERTS	Row 4 →
5	INSERT	Row 5 →
6	DENSER	Row 6 →
7	REPAID	Col 1 ↓
8	DIAPER	Col 1 ↑