1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18# Q. Write a PROLOG program to solve the problem Towers of Hanoi ## Code toh_move(1,X,Y,_) :- write('Move top disk from '), write(X), write(' to '), write(Y), nl. toh_move(N,X,Y,Z) :- N>1, M is N-1, toh_move(M,X,Z,Y), toh_move(1,X,Y,_), toh_move(M,Z,Y,X). ## Query toh_move(3,1,2,3).