This is a classical variation over the Towers of Hanoi where some moves are forbidden. Specifically, disks cannot move directly between the left-most and the right-most pegs. The middle peg must be involved in every moves.
Beside of that extra complexity, the problem remains unchanged: you are requested to move the whole stack of disks from one extremity peg to the other one. You can only move one disk at a time, and a bigger disk cannot be placed over a smaller one.
As with the classical version, it is much easier to produce a recursive solution, and you are absolutely able to devise this solution if you think hard enough about it.