giles
39f4c7a9a8
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 26s
Classic doubly-recursive solution returning the move count:
hanoi n from to via =
if n = 0 then 0
else hanoi (n-1) from via to + 1 + hanoi (n-1) via to from
For n = 10, returns 2^10 - 1 = 1023.
Exercises 4-arg recursion, conditional base case, and tail-position
addition. Uses 'to_' instead of 'to' for the destination param to
avoid collision with the 'to' keyword in for-loops — the OCaml
conventional workaround.
37 baseline programs total.
12 lines
191 B
OCaml
12 lines
191 B
OCaml
let rec hanoi n from to_ via =
|
|
if n = 0 then 0
|
|
else
|
|
let a = hanoi (n - 1) from via to_ in
|
|
let b = 1 in
|
|
let c = hanoi (n - 1) via to_ from in
|
|
a + b + c
|
|
|
|
;;
|
|
|
|
hanoi 10 1 3 2
|