Introduction - If you have any usage issues, please Google them yourself
Tower of Hanoi problem: There are three pillars ABC, A column has n different sizes of plates, the broader market in the next, small cap on. Requires that all of the plates to move C from A column column, you can only move one can make use of the process of moving to another post, but must meet the market in the next, small cap on.