Then the rules that are too hard should ideally be disallowed, and the ones that aren't shouldn't be. BTW your second example fails the spock rule... ----- Original message ----- > Shadowfirebird <shadowfirebird@xxxxxxxxx> wrote: > > > If we're agreed that it is a poor rule, then rather than trying to > > decide > > whether it is valid according to the One True Rules (which is at best > > academic), maybe we should be trying to find an interpretation of the > > rules > > that makes it invalid. Or, the problem with the rules as written which > > means it is valid when it should not be. > > Here's the thing--I don't think it should be invalid. It's a reductio > example of of a too hard rule, but there are plenty of other rules in > that spectrum that are, and should be valid rules. > > Depending on what direction you"re going, rules in that spectrum which > aren't necessarily too hard are: > > Bn iff consists of a single stack, and that stack is in alphabetical > order by color. (Violet = violet, clear = clear) > > Bn iff the koan contains a color that was present on the shirt I was > wearing when the game started. > > Bn iff it exactly matches the starting koan. > > _______________________________________________ > Icehouse mailing list > Icehouse@xxxxxxxxxxxxxxxxxxxx > http://lists.looneylabs.com/mailman/listinfo/icehouse