4.0
Other
This script solves The Tower of Hanoi puzzle of n disks. It implements the Recursive solution in Prolog.
The Tower of Hanoi is a mathematical puzzle consists of three needles (left, right and center) and n disks of different sizes which can slide onto any of the three needles. The puzzle starts with the disks in a neat stack in ascending order of size on one needle, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
3. No disk may be placed on top of a smaller disk.
The minimum number of moves required to solve a Tower of Hanoi puzzle is 2n - 1, wh
others
使用
AIProlog
问题
No comment