Algorithm for Multilple Player Last Nim for Any Alliance System

The Last Nim game is an impartial combinatorial game studied only in the case of the standard alliance matrix. In this paper, we consider the Last Nim game with N linearly ordered nonempty piles containing counters, and n players for any alliance matrix. For this, we give an algorithm to get the winner, the tree of all possibilities of the game, and the best strategy for the winner. For the practical result, we implement this algorithm using C++ language and give some examples.