**From New Scientist #2607, 9th June 2007**

For each answer in these cross-figures, two clues have been given; one applies to each figure, but in no particular order.

**Across:**

1. The sum of the digits of 1D. (2); The product of the digits of 1D. (2)

3. A multiple of 3A from the other figure. (2); A divisor of 3A from the other figure. (2)

4. A multiple of 1D but not equal to 1D. (3); Not a multiple of 1D. (3)

**Down:**

1. Equal to a prime × 3D. (3); Not equal to a prime × 3D. (3)

2. Differs from the square of 3A by 1. (3); Differs from the square of 3D by 1. (3)

3. The sum of the digits of 4A. (2); The product of the digits of 4A. (2)

Find the completed grids (in either order).

[enigma1446]

### Like this:

Like Loading...

*Related*

I found this quite a fun puzzle to solve programatically.

This Python code makes heavy use of Python’s generator construct (

`yield ...`

) and also uses the`yield from ...`

generator delegation construct, introduced in Python 3.3, so it won’t work in Python 2.7 (although in this case you could just replace the`yield from`

withexpression`for x in`

and it would work). It runs in 2.3s.expression: yield xSolution:The two completed grids are: