### Random Post

### Recent Posts

- Enigma 427: Settle some new scores
- Puzzle 59: Cricket
- Enigma 426: Time and again
- 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

### Recent Comments

Jim Randell on Enigma 427: Settle some new… | |

Jim Randell on Enigma 427: Settle some new… | |

geoffrounce on Enigma 1503: Division dec… | |

arthurvause on Enigma 425: Them thar’… | |

Jim Randell on Puzzle 59: Cricket |

### Archives

### Categories

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

### Site Stats

- 170,314 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.