### Random Post

### Recent Posts

- Enigma 1096: Prime break
- Enigma 415: Buses galore
- Puzzle 65: Division: figures all wrong
- Enigma 1097: Chessboard triangles
- Enigma 414: Nicely bungled, Sir!
- Tantalizer 473: Pigeon post
- Enigma 1098: Soccer heroes
- Enigma 413: Quargerly dues
- Puzzle 66: Hopes and successes on the island
- Enigma 1099: Unconnected cubes

### Recent Comments

geoffrounce on Enigma 1096: Prime break | |

Brian Gladman on Enigma 1096: Prime break | |

Hugh Casement on Enigma 1096: Prime break | |

Jim Randell on Enigma 1096: Prime break | |

Jim Randell on Enigma 415: Buses galore |

### Archives

### Categories

- article (11)
- enigma (1,107)
- misc (2)
- project euler (2)
- puzzle (27)
- site news (43)
- tantalizer (27)
- teaser (3)

### Site Stats

- 164,475 hits

You can solve this puzzle using a simple recursive program (see Enigma 1780), or with a more strategic based solver (see Enigma 1657), but here’s a program that uses PyMathProg to solve the puzzle using ILP. It runs in 69ms.

Solution:The letters in the second row are G E M N A I.There are two possible arrangements of the grid, but the PyMathProg solution stops when it finds a solution.