### Random Post

### Recent Posts

- 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
- Enigma 412: A triangular square

### Recent Comments

### Archives

### Categories

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

### Site Stats

- 164,322 hits

This Python program tries to fit the dominoes into the grid recursively, checking the products as rows and columns are completed. It runs in 3.2s.

Solution:The four horizontal dominoes are: 1-2, 2-2, 3-4 and 4-4.Here is a diagram of the layout of the dominoes (horizontal dominoes are shown in red, vertical dominoes in blue):

There are two other ways to lay out the dominoes which give the same numerical grid, but each of them has six horizontal dominoes: