A study of the recursive algorithm for solving the Tower of Hanoi problem on the basis of permutations
The paper analyzes a system of permutations describing the recursive algorithm for solving the problem of the Tower of Hanoi. It is shown that for the three rods there are 6 possible permutations of the variables denoting the rods and their global and local meaning. Examples of permutations in the problem for one, two and three disks are given.