Multi-pile nim game implementation using minimax algorithm
Given a number of piles in which each pile contains some numbers of stones/coins. In each turn, a player can choose only one pile and remove any number of stones (at least one) from that pile. The player who cannot move is considered to lose the game (i.e., one who take the last stone is the winner).
Nim - https://en.wikipedia.org/wiki/Nim
Minimax - https://en.wikipedia.org/wiki/Minimax