The following Prolog program solves the hanoi tower problem:
hanoi(N) :- move(N, source, center, destination).
move(1, S, _, D) :- write('Move top from '), write(S), write(' to '), write(D), nl.
move(N, S, C, D) :- N>1, M is N-1, move(M, S, D, C), move(1, S, _, D), move(M, C, S, D).
What are the size-(N-1) problems in the program? Select all that apply.
A. move(N, S, C, D)
B. move(1, S, _, D)
C. move(M, C, S, D)
D. move(M, S, D, C)
Answer. C and D.