### 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

I think this one is probably easier to solve analytically than by programming, but here’s a Python program that solves it in 52ms.

Solution:The entries that are scores are A vs. D, B vs. C and C vs. D.We can deduce quite a lot more information from the unique solution. We know that the the table must have been published on the evening of the 3rd January (3/1), and that the A vs. B match was played on the 4th January (4/1), and that the match was drawn. A vs. C was played on 2nd March (2/3) and was also a draw. The A vs. D match was played on 1st January (1/1), and the score was 1-3 (a win for D). B vs. C was also played on 1st January (1/1) (and so there must be two venues, as we are told the matches all start at 3pm). B vs. D was played on the 4th February (4/2), and was a draw. Finally C vs. D was played on 3rd January (3/1), the result was 3-4 (another win for D).

The final points table is: D = 7 points (wins against A and C, draw against B), B = 5 points (win against C, draws against A and D), A = 2 points (draws against B and C), C = 1 point (draw against A). Giving an odd total of 15 points.

We have to schedule two matches on 1st January (1/1) to permit a solution, but this is not explicitly disallowed by the problem statement.

The programming turned out to be a bit more convoluted than I was expecting. If you don’t try work out a valid schedule for the played matches you end up with a second possibility, which is that A vs. B, A vs. C and C vs. D are the entries that are scores. But in this situation B vs. C is scheduled to be played on 4th January (4/1), so the paper must be published on (or before) 3rd January (3/1). So the three played games (A vs. B, A vs. C, C vs. D) must all have happened on the 1st, 2nd or 3rd January, but there is no way to schedule them (there are two matches involving A, so they must have been played on 1/1 and 3/1, but B vs. C is scheduled for 4/1 so the A vs. C match cannot be played on 3/1 (to avoid C playing on two consecutive days), but neither can the A vs. B match (to avoid B playing on two consecutive days), hence there is no possible way the matches can have been scheduled).