Towers of Hanoi- Let the game begin.
 Question: ```The Towers of Hanoi puzzle was published in 1883 by the French mathematician Edouard Lucas, under the pen-name, N. Lucas de Siam. The objective of the game is to move all the disks onto the further pole. There are only two ruls to consider: 1.You can only move one disk at a time. 2.You must follow size order : a bigger disk can not go on a smaller disk. This puzzle is well known to Computer science students, as it appears virtually in any introductory text on data structures or algorithms. For more Info clik on the link below: http://blossoms.mit.edu/videos/lessons/towers_hanoi_experiential_recursive_thinking link to the game: http://www.playnow.co.il/hebrew.cfm/play/Tower-of-Hanoi You are currently on your 14th move in the game. You are playing with 5 discks.(picture 1). ```                   (picture 1) In according to what you have learned, in order to complete the game in a minimum moves, what would be your next move? For a hint, watch the video below (video 1):   (video 1)
2 People tried to answer this question

 The next move, will be to move Disk no' 1, from C to B.
 The next move, will be to move Disk no' 3, from B to C.
 The next move, will be to move Disk no' 2, from A to B
 The next move, will be to move Disk no' 1, from C to A

It seems, that you understand the material.

The smallest disk moves in a cycle, As you have already learned:

Anti clockwise if N is odd

Clockwise if N is even

If we will move it to the A pole it will not be in minimum moves.

Try again.

As you have learned You must follow size order :
a bigger disk can not go on a smaller disk.
Try again.

Think again.
You will not complete the task with the minimum moves.

try again.

 Points on map: