#Hanoi towers without recursion generator
#Hanoi towers without recursion code

Implementing the display and animation code is left as an exercise for the reader. Tower1, tower2, tower3 = tower2, tower3, tower1 Tower1, tower2, tower3 = LABEL1, LABEL2, LABE元įor source,target in hanoi(n, tower1, tower2, tower3): Then main() can be something like: def main(): Yields (from, to) tuples, which means move the top disc from `from` to `to`.įor src, dst in hanoi(3, 'Alpha', 'Bravo', 'Charlie'): It yields the steps for moving a stack of n discs from the source tower

#Hanoi towers without recursion generator

'''A generator to solve an n-disk Tower of Hanoi problem. Modify the problem solving code to return a list of moves, or, better yet, turn it into a generator that yields the steps as needed: INTER_STEP_PAUSE = 0.2 It would be better if the problem solving code just solved the problem and the animation code just did the animation. Will you remember that each animation step is started from move_one()?

Will you remember the delay is in the tower solving code and not somewhere in the animation code? Or you want to modify the code to drive an HTML canvas routine. For example, a year from now, you want to change the delay. That can make it harder to maintain or reuse the code. The function move_one() does three things: 1) starts the animation for a move, 2) helps solve the problem (updating the state), and 3) adds a delay between steps in the animation. However, the drawing/animation functions are coded to use a global variable N for the number of discs.

Alternate between moving the smallest disk and making the only valid move which does not involve the smallest disk. This implies that you can select what size problem to solve by changing n. / tower.c Tower of Hanoi - mechanical solution Arrange the three rods to form a triangle. I'll just state the algorithm here.You may need to know the stack data structure in C to implement it There are three poles.The source pole,The auxiliary pole and The Destination pole. move_multiple() takes a parameter n that is the number of disks to move. Yes ,the Tower of Hanoi problem can be solved using iteration in C. How would they change if you wanted to do some other kind of animation? I would add a ASCII art drawing of a puzzle being solved, annotated with the dimensions and formulas. There are lots of formulas in the drawing code, like: + SPC * (N-n) + tkn * n + RIGHT + tkn * n + SPC * (N-n) This relatively short piece of code (126 lines) works and at this moment I understand it, but do you, and will I in six month time? What should I change to the code to make it more readable and understandable (I know I've sinned against PEP8 sometimes). Path = find_screen_path(src, height_src, dst, height_dst)įor old, new in zip(path, path): If end_right < cur_right : direction = -1 Up, right = find_screen_pos(pole, height)ĭef find_screen_path(pole_1, height_1, pole_2, height_2):Ĭur_up, cur_right = find_screen_pos(pole_1, height_1)Įnd_up, end_right = find_screen_pos(pole_2, height_2) Today I tried to reproduce the code from the video and came to this: A = 'A' A few days ago I saw a nice video on YouTube with prof Thorsten Altenkirch about recursion and the Tower of Hanoi puzzle.