(C program) HOW TO FIND THE MINIMUM NUMBER OF MOVES NEED TO MOVE 'N' DISK IN NO FLY OVER TOWER OF HANOI

HOW TO FIND THE MINIMUM NUMBER OF MOVES NEED TO MOVE 'N' DISK IN NO FLY OVER TOWER OF HANOI , (C PROGRAM) with comments please.

The Tower of Hanoi is a mathematical game for moving a set of N disks stacked in the order of decreasing size from one pile to another (using a spare pile) one disk at a time without ever placing a larger disk on top of a smaller disk. The No-Flyover Tower of Hanoi is derived from the Tower of Hanoi with the following modifications: When a disk is moved, it is not allowed to jump over a smaller disk on the spare pile. Pile A Pile B (Spare Pile C The number of moves it takes to complete a Tower of Hanoi game in the minimum number of steps can be calculated in a recursive manner as shown below. int hanoi (int n) if (n1) return 1; else return 2 * hanoi (n-1) 1 The number of moves required for a no-flyover Tower of Hanoi game would be different but can be calculated in a similar manner or directly from the simulation