游戏规则：将总数为M的纸牌（是N的倍数），任意的划分成成数目不等的N堆，然后经过下列规则的移动，使得每堆牌的数目相等：1.要向第i堆牌移动牌，只能从i+1堆或i-1堆中取得；2.第一堆牌只能从第二堆牌中取得；3.第N堆牌只能从第N-1堆牌中取得。

算法要求：求解均分时的最小移动次数-Rules of the game: the total M of the card (which is a multiple of N), divided into any number ranging from N into the heap, and then move through the following rules so that an equal number of cards per pile: 1. To the i-heap brand mobile card, only from the i+1 or i-1 heap heap made　2. The first pile of cards can only be obtained from the second reactor licensing　3. s N reactor license only from the first N-1 reactor license achieved. Algorithm requires: Solving the minimum number of moves when sharing