The Three Musketeers of "game"

Bashbor has a pile of n items, two people take turns from this pile of goods, the provision of at least one at a time, the maximum number of M. Finally, the winner wins (note: If n=m+1 anyway the latter wins) the first fetch remains to the opponent (M+1 ), you can win the final *******************************************************************************  Witzov game has two piles of various items, two people take turns from a heap or at the same time from the two piles of the same number of items, the provisions of at least one at a time, more than unlimited, the last to take the light to win the singular situation, first take the person will be lost AK=[k (1+√5)/  2],bk= AK + k (k=0,1,2, ... n)*****************************************  ^BK ^ck^. nk=0

The Three Musketeers of "game"