### Random Post

### Recent Posts

### Recent Comments

Jim Randell on Tantalizer 452: Snailspaces | |

Brian Gladman on Enigma 1061: Par is never… | |

Hugh Casement on Enigma 1061: Par is never… | |

Jim Randell on Enigma 1061: Par is never… | |

geoffrounce on Puzzle 47: Digits all wro… |

### Archives

### Categories

- article (11)
- enigma (1,175)
- misc (2)
- project euler (2)
- puzzle (44)
- site news (46)
- tantalizer (48)
- teaser (3)

### Site Stats

- 183,007 hits

Advertisements

The Python program examines all possible letter to digit assignments and checks to see if they make a valid match. It runs in 339ms.

Solution:The score in the final three sets was 5-7, 9-8, 9-7.The program finds 20 ways to achieve the solution, these correspond to the scores in the first two sets being 6-

xandy-6, where (x,y) correspond to all possible 2-permutations from (0, 1, 2, 3, 4), and P(5, 2) = 20.