Tower of Hanoi moves

Challenge

Implement:

long long hanoi_moves(int n);

Return the minimum number of moves to solve the Tower of Hanoi with n disks, computed recursively. 0 <= n <= 62.

Input format

n in [0,62].

Output format

Minimum moves (2^n - 1).

Constraints

Use long long.

Starter code

#include <stddef.h>
/* Minimum number of moves to solve Tower of Hanoi with n disks (recursively). 0<=n<=62. */
long long hanoi_moves(int n){ (void)n; return 0; }

Common mistakes

Forgetting the +1 for moving the largest disk.

Edge cases to handle

0 disks need 0 moves.

Background lessons

• Tower of Hanoi & accumulators