Any ideas on how to approach this problem? Compute minimum number of moves to transfer n pegs from P1 to P2. Stacking condition is relaxed. Largest ring in any peg must be the bottom most one in that peg. Other disks in that peg can be in any order. This looks very complicated to me.
