You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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())
...
Original issue reported on code.google.com by cnvo...@gmail.com on 10 Nov 2014 at 7:38
The text was updated successfully, but these errors were encountered:
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!
Original comment by pde@n-side.com on 13 Nov 2014 at 9:10
Original issue reported on code.google.com by
cnvo...@gmail.com
on 10 Nov 2014 at 7:38The text was updated successfully, but these errors were encountered: