The second variant of Towers of Hanoi problem asks to “Find the minimum number of operations subject to the constraint that each transfer must involve P3”.
Previously, only 3 pegs were mentioned in the main problem: P0, P1, P2. So is it implied in this variant that there is a new peg P3, and we now consider this as a 4 peg problem (P0, P1, P2, P3)?
Also, is an “operation” equivalent to a move? Meaning that for 3 pegs there are 2n - 1 operations/moves?