Suggestion for a nice example: Grime's Dice

[Former user]

Originally reported on Google Code with ID 5

Hi, here's a suggestion for a nice example using Grime's non-transitive dice, maybe
you want to include something similar in the README? 

http://grime.s3-website-eu-west-1.amazonaws.com/

The idea behind Grime's dice is that you have three dice, red, blue, olive which win
against each other in a cyclic way. (one beating the other in about 5:7). When you
have two dice of the same colour, they beat each other, too, but the other way 'round.

red   = Lea.fromVals(3,3,3,3,3,6)
blue  = Lea.fromVals(2,2,2,5,5,5)
olive = Lea.fromVals(1,4,4,4,4,4)

print(red > blue)
print(blue > olive)
print(olive > red)

print(red+red.clone() > blue+blue.clone())
...

Reported by cnvogel on 2014-11-10 07:38:52

[Former user]

This is a great example, indeed!
However, a similar case is ALREADY in the Lea wiki "Examples" page. See 

https://code.google.com/p/lea/wiki/Examples#nontransitive_dice

Thank you anyway for the suggestion. Your modelling shows that you have perfectly grasp
the Lea's concept!

Reported by [e-mail] on 2014-11-13 09:10:30

[Former user]

I have added the link to Grime's page in the Lea wiki "Examples" page.

Reported by [e-mail] on 2014-11-14 14:22:30 - Status changed: Done