Galle wrote, in part: > * If eir Operator is Product, pay 5 spendies, an X card, and a Y card > to grant emself a number card with a type equal to the last digit > of the product X * Y. > * If eir Operator is Sum, pay 6 spendies, an X card, and a Y card to > grant emself a number card with a type equal to the last digit of > the sum X + Y. > * If eir Operator is Difference, pay 8 spendies, an X card, and a Y > card to grant emself a number card with a type equal to the last > digit of the difference X - Y. > --- > === > > Both previous attempts at Operands were rejected largely due to the > fact that the Operands were clearly unbalanced, with the non- > commutative Operands being much stronger than the commutative ones. > This is an attempt to balance them out by varying the crafting cost. > Product is cheaper than Sum due to being useless when used on a 1 > card
Why is Difference more expensive than Sum? They *seem* to be equally strong. But in fact a check reveals that Sum is stronger: Of the 100 possible combinations of X and Y (accounting for order), the following results (sums and differences) appear as many times as noted: result sums differences 0 10 10 1 10 18 2 10 16 3 10 14 4 10 12 5 10 10 6 10 8 7 10 6 8 10 4 9 10 2 (only 9,0 and 0,9) Yours, msh210
