In the Tower of Hanoi problem with 3 rods (1, 2 & 3), the goal is to move a tower of disks from rod #1 to rod #2. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.
At the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.
Give the number of moves necessary to solve the problem.
Find state names that start with the letter N
427 Solvers
155 Solvers
Convert a numerical matrix into a cell array of strings
112 Solvers
Duplicate each element of a vector.
438 Solvers
Basics: 'Find the eigenvalues of given matrix
242 Solvers
Tags