# Write a function that takes number of disks in tower of hanaoi problem and returns the minimum number of steps required

## Topic: Write a function that takes number of disks in tower of hanaoi problem and returns the minimum number of steps required

Solution

def hanoi(x): if x == 1: return 1 else: return 2*hanoi(x-1) + 1

List all Python Programs