Mischief wrote, in part: > > For any two decimal digits X and Y (which may be the same), a > > player CAN pay 2 spendies, a number card of type X, and a number > > card of type Y to grant emself a number card whose type is equal > > (modulo 10) to: > > > > * X+Y, if eir Operand is Sum > > > > * X-Y or Y-X, if eir Operand is Difference > > > > * X*Y, if eir Operand is Product > > > > * floor(X/Y) or ceiling(X/Y), if eir Operand is Quotient and Y > > is not 0 > > Someone who didn't like the first version would probably like this one even > less, since now Quotient can turn a given pair into as many as four > different outcomes (as opposed to a max of two in the prior version). > Example: 2 and 7 can become 0, 1, 3, or 4.
How about, instead, an operand defined as follows? If e has X and Y with X≥Y>0, e can change them in for either (at eir choice) X mod Y (the remainder when dividing X by Y) or floor(X/Y)? msh210
