Python Hanoi Tower Implementation Ideas

Hanoi goal: The idea of moving n plates on a pillar to the C-pillar recursion is to break this goal down into three sub-target sub-goal 1: Move the first n-1 plate from A to B on sub-goal 2: Move the bottom of the last plate from a to C sub-goal 3: Move the n-1 plate on B to C

Move (n, a, B, c): n==: (a++c) Move (N-,A,C,B)//Sub-target 1: Move the former n-1 tray from A to B move (, A,B,C)//Sub-target 2: Move the bottom of the last plate from a to C Move (N-,B,A,C)//Sub-target 3: Move the n-1 plate on B to c move (,,,)

This article is from the "11857302" blog, please be sure to keep this source http://11867302.blog.51cto.com/11857302/1963577

Python Hanoi Tower Implementation Ideas