% simpleHanoi.pl.txt
% Towers of Hanoi puzzle solver in Prolog.

% Goal is to move, say, 5 disks from left peg
% to right peg, using the middle as a buffer.

go :- solve(4, left, middle, right).

solve(N, A,B,C) :- N == 0.
solve(N, A,B,C) :-
  M is N - 1,
  solve(M, A, C, B),
  move(A, C),
  solve(M, B, A, C).

move(A, B) :- write('Move disk from '),write(A),write(' to '),write(B),nl.