In the Towers of Hanoi example, the monks first move n-1 disks to the middle peg, then the remaining 1 disk on the right peg, and then the n-1 disks from the middle to the right peg.

An alternative high-level strategy is to first move 1 disk to the middle peg, then the remaining n-1 disks to the right, and then the middle 1 disk to the right. 

This is also a divide-and-conquer strategy?