Towers of Hanoi

Article View: fj.lang.prolog

Article #74

#74

From: David Hiett
Date: Sun, 29 Mar 1998 00:00

9 lines
657 bytes

Does anyone have a simle to understand recursive program to solve the
classic 'towers of hanoi' problem.

Any pointers to how to do it would be much appreciated as I am relatively
new to prolog programming.

regards,
Dave

Technical Details

Message-ID: <6fma13$acd$3@nclient5-gui.server.virgin.net>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 1217ff,a6bdd1bc698a0076,start
X-Google-Attributes: gid1217ff,public
From: "David Hiett" <david.hiett@virgin.net>
Subject: Towers of Hanoi
Date: 1998/03/29
Message-ID: <6fma13$acd$3@nclient5-gui.server.virgin.net>
X-Deja-AN: 338902494
X-MimeOLE: Produced By Microsoft MimeOLE V4.71.1712.3
Organization: Virgin Net Usenet Service 
Newsgroups: fj.lang.prolog