### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,158)
- misc (2)
- project euler (2)
- puzzle (40)
- site news (44)
- tantalizer (42)
- teaser (3)

### Site Stats

- 178,002 hits

Advertisements

Programming Enigma Puzzles

26 November 2012

Posted by on **From New Scientist #2646, 8th March 2008**

I asked some friends to put the letters C, L, X, V or I in each of the boxes of the IV × IV square so that each row, each column (read from top down) and both diagonals (also read downwards) form 10 different valid Roman numerals less than CC, and then add the total of the 10 numbers to give a “score”. Twelve solutions were found, but Pauline noticed that one pair of solutions had scores differing by C, and Robert noticed another pair whose scores differed by C. The scores of Pauline’s pair were both divisible by V.

What were the scores of Robert’s pair? (Give the answer in Roman or Arabic form).

The posting of this puzzle completes my continuous run of ** Enigma** puzzles from when I started doing them every week – with

[enigma1484]

Advertisements

%d bloggers like this:

In order to get only twelve squares you have to disallow the special case IIII as a permissible representation of 4. The following Python code uses the

int2roman()androman2intfrom theenigma.pylibrary and runs in 488ms.Solution:The scores for Robert’s pair are 648 and 748.