### Random Post

### Recent Posts

### Recent Comments

Hugh Casement on Enigma 1070: Time to work | |

Jim Randell on Enigma 1070: Time to work | |

Jim Randell on Enigma 1070: Time to work | |

geoffrounce on Enigma 440: Three X | |

Jim Randell on Enigma 1588: As easy as 1… |

### Archives

### Categories

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

### Site Stats

- 177,568 hits

Advertisements

See also:

Enigma 270,Enigma 1596.In Enigma 1596 we saw that N=36 is possible, and as there are 40 possible blocks the upper bound is N=40.

This Python 3 program is adapted from my recursive solution to Enigma 270. It finds the possible arrangement of blocks of stamps, and then recursively assigns stamps to the grid to find the maximum possible value for N. It runs in 17.2s.

Solution:The maximum values forNisN=36.There are two different ways of achieving this, shown below (along with their reflections):

As there are 40 ways of making blocks of stamps, some denominations must be repeated.

For the first arrangement the repeated values are:

For the second arrangement the repeated values are:

A solution in Picat using a combination of logic programming (e.g. member/2 for building the valid configurations), plain iterative programming, and Constraint Programming (for solving the specific instances): http://hakank.org/picat/six_stamp_sheet.pi

It find max M=36 in 2.7s.