### Random Post

### Recent Posts

- Enigma 1065: Cute cubes
- Enigma 444: Rows and rows
- Puzzle 50: Football and addition
- Enigma 1066: Members of the clubs
- Enigma 443: The bells they are a-changing
- Tantalizer 455: Ballistico
- Tantalizer 456: Square deal
- Enigma 1067: Bye!
- Enigma 442b: Oh yes I did! Oh no you didn’t!
- Puzzle 51: A multiplication

### Recent Comments

Brian Gladman on Enigma 1065: Cute cubes | |

Jim Randell on Enigma 1065: Cute cubes | |

geoffrounce on Enigma 444: Rows and rows | |

Jim Randell on Enigma 444: Rows and rows | |

geoffrounce on Enigma 1611: Three sister… |

### Archives

### Categories

- article (11)
- enigma (1,167)
- misc (2)
- project euler (2)
- puzzle (42)
- site news (45)
- tantalizer (45)
- teaser (3)

### Site Stats

- 180,599 hits

Advertisements

This puzzle is fairly easy to solve with pencil and paper, but here’s a solution using the

CrossFigure()class from myenigma.pymodule. It considers the possible odd and even digits, and then tries to solve a cross figure puzzle for each combination (only one combination has possible solutions for each answer in the gird). This Python code runs in 43ms.Solution:The answer to 1 across is 44454. The answer to 7 across is 45444.Here’s the completed grid:

Here’s the manual solution:

Both 1A and 1D must end with the even digit, hence both 3D and 7A must start with it, so it cannot be 0. So 5A must have 5 as its final digit and the even digit as its first digit.

So 3D must be composed of four even digits with a 5 in the middle, and be divisible by 3. The only possible candidate is 44544.The rest of the grid then follows.

These ‘cross figure’ enigmas are very uninspiring in my view.

Agreed – it’s not a very inspiring puzzle.

I wrote the

CrossFigure()solver because it was more fun to write the general solver than solve another cross figure puzzle (Enigma 1755), but of course that makes subsequent puzzles even less of a challenge. (Except it’s nice to know that the code I wrote does work on them).And I don’t think you need even to consider the ‘o0’ pairs for 5A, because both 1A and 1D must end with the even digit, so 3D and 7A must start with it, hence it can’t be 0.

I agree that I could cut out the digit pairs including a zero as you suggest. When I started this, I added this restriction on digit pairs as I thought that a recursion depth of 20 might make it slow even though each step only involved two alternatives. But looking at all (even, odd) diigit pairs is still almost instantaneous so it was really not necessary. ..

25,45,65 and 85 are the only numbers divisible by 5 under the limitations given.

Then by trial and error one can reach the two digits , hence the solution.