This is a course page of David Casperson 

For assignment credit use some kind of straightforward logic. For your own amusement see if you can make the running time more reasonable. For this game, there is an algorithm that allows you to calculate winning positions in your head; although it takes a bit of practise.
If you wish to check your
logic, here is a
binary that runs
on galaxy.unbc.ca
.
uncurry2
that has the property
that f = uncurry2
(curry2
(f)).
curry3
.
fun f n = if n>100 then n10 else f(f(n+11))
Attempt to prove that your answer is correct by some form of induction.
published