As I remember the problem, there are two simple rules for moving the discs. If the pile starts on peg A, and you want to move it to peg B (the target peg), using peg C as the "storage" peg, and you want to move an even number of discs, you move the first one to the storage peg. When you want to move an odd number of discs, you move the first disc to the target peg.

If you continue this procedure for all moves, without a mistake, you will achieve the minimum of 2^n-1 moves.

I do not understand the phrase "grad standard", so I do not know is this is what you want.

For your problem of 7 discs, and you want to move them from peg A to peg B, you start by moving the first disc to peg C, the second disc to peg B, then the one on peg C on top of the one on peg B. You have now moved two pegs in three moves. Then you move the third disc to peg C. Then using the same procedure as before, move the first two discs onto peg C. You have now moved three discs using 7 moves. Then you move the fourth disc onto peg B followed by moving the first 3 discs onto peg B. This will take another 8 moves for a total of 15. You continue this on and on for the total of 127 moves.

I hope this is at least some help.

Jack