### Random Post

### Recent Posts

- Enigma 1084: 1-2-3 triangles
- Tantalizer 466: Diplomacy
- Tantalizer 467: Nine men went to mow
- Enigma 1085: Cut and run
- Enigma 425: Them thar’ Hills
- Puzzle 60: Uncle Bungle gets the last line wrong
- Enigma 1086: Stacking trays
- Enigma 424: A round of fractions
- Tantalizer 468: Shell fire
- Enigma 1087: Egyptian triangles

### Recent Comments

Jim Randell on Enigma 1084: 1-2-3 triang… | |

Brian Gladman on Enigma 1084: 1-2-3 triang… | |

Jim Randell on Enigma 1084: 1-2-3 triang… | |

geoffrounce on Enigma 1631: Joe’s … | |

geoffrounce on Enigma 1626: Pascal’s… |

### Archives

### Categories

- article (11)
- enigma (1,128)
- misc (2)
- project euler (2)
- puzzle (32)
- site news (43)
- tantalizer (34)
- teaser (3)

### Site Stats

- 169,890 hits

This Python 3 program runs in 41ms.

Solution:The remaining letters in each row, from top to bottom, are: G, B, A, E, F, C, H, I, D.There is only one solution for the grid, shown below:

For 9 letters each occuring 3 times, it is feasible to do a brute force search of the 3**9 = 19683 possible options of distinct letters, but this solution wouldn’t be scalable.