Algorithm idea: 1. If there is only a gold film, while the gold from the source to the target mobile wand, The End. 2. If there are n gold films, while the former n-1 gold piece to move to the auxiliary rod, and then move to the goal of their own stick, then the last n-1 before moving to the target rod. 3. Simply to have N a gold piece to move step calculated, you can use recursive methods to meet the recursive equation f (i) = f (i- 1)* 2+ 1

汉诺塔
......\Debug
......\汉诺塔.cpp
......\汉诺塔.dsp
......\汉诺塔.dsw
......\汉诺塔.ncb
......\汉诺塔.opt
......\汉诺塔.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．