There's nothing about the lambda calculus which forces you to use the church encoding of natural numbers. You could also come up with an encoding based on booleans as bits: {true} = \t f. t {false} = \t f. f then bytes:…
Got the same. There are 200 ways of doing this (if you don't distinguish between the 2 bunnies when they're on the same tile, 420 if you do). If you merge together moves involving the same animal there are only 4 (with…
There's nothing about the lambda calculus which forces you to use the church encoding of natural numbers. You could also come up with an encoding based on booleans as bits: {true} = \t f. t {false} = \t f. f then bytes:…
Got the same. There are 200 ways of doing this (if you don't distinguish between the 2 bunnies when they're on the same tile, 420 if you do). If you merge together moves involving the same animal there are only 4 (with…