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.
5488 Solvers
Check to see if a Sudoku Puzzle is Solved
219 Solvers
137 Solvers
Sum the entries of each column of a matrix which satisfy a logical condition.
104 Solvers
Create matrix of replicated elements
249 Solvers
Tags