### Random Post

### Recent Posts

- Enigma 1109: All square in games
- Enigma 402: A DIY puzzle
- Puzzle 71: All wrong, all wrong
- Enigma 1110: Dots and lines
- Enigma 400: Potential difficulties
- Tantalizer 479: Cat and five tales
- Enigma 1111: Base-age
- Enigma 399: Time, gentlemen, please
- Tantalizer 480: Pitter patter
- Enigma 1112: Patio zones

### Recent Comments

Jim Randell on Enigma 1653: Cut-free | |

Jim Randell on Enigma 1109: All square in… | |

Jim Randell on Enigma 402: A DIY puzzle | |

geoffrounce on Puzzle 71: All wrong, all… | |

Jim Randell on Puzzle 71: All wrong, all… |

### Archives

### Categories

- article (11)
- enigma (1,080)
- misc (2)
- project euler (2)
- puzzle (21)
- site news (42)
- tantalizer (21)
- teaser (3)

### Site Stats

- 157,134 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.