Description: Write LISP function to solve the problem of Hanoi is Tower (Chinese tower). The questions are as follows: Brahma tower A, B, C, of the three columns, the beginning of the A pillar n plates, the plates of varying sizes, big next on. Take the n-plate from the A pillar to the B-pillar, only allowed to move a plate at a time during the move, always keep the market in the next three columns, small. During the move can take advantage of the C-pillar, steps for program output moving.
To Search:
File list (Check if you may need any files):
lispChinesetower.doc
Download