### Random Post

### Recent Posts

### Recent Comments

geoffrounce on Enigma 440: Three X | |

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

Jim Randell on Enigma 440: Three X | |

geoffrounce on Enigma 1106: Not a square… | |

Jim Randell on Tantalizer 458: Knifemen |

### Archives

### Categories

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

### Site Stats

- 177,401 hits

Advertisements

This Python code runs in 49ms.

Solution:MEANINGS = 56123247.So the 9-sided die has values 1, 2, 2, 3, 3, 3, 4, 4, 5. And the 4-sided die has values 1, 4, 4, 7.

Without the analysis from the 2 and 12 cases the same program examining all the possible permutations of values for ENIGMA from 1 to 6 and S from 1 to 7 runs in 113ms.

A Funny Dice problem involving non standard dice was published in the Sunday Times in March this year. The ensuing discussion involved one contributor alerting me to an interesting mathematical approach for solving puzzles of this general type. Here is a solution to this enigma teaser using the approach (it requires my number theory and polynomial libraries).

It takes a lot more effort to program (and is slower too) but the maths is elegant and that appeals to me.

Here’s a MiniZinc solution of #290: http://hakank.org/dice_with_a_difference_enigma_290.mzn

I especially like the declarative constraints of this.

And here’s a MiniZinc model of the Funny Dice problem, using the same basic approach for calculating the probabilities (though now they are decision variables instead of constants): http://hakank.org/minizinc/funny_dice.mzn

Gecode solves this in 48ms using “var int”, or 36ms when using var 1..12 as the domains.

Related: The Nontransitive dice problem (with some explorations): http://hakank.org/minizinc/nontransitive_dice.mzn