Generic Minimax algorithm in C#
To be more precise using Negamax algorithm with Alpha-Beta pruning.
The idea is to provide a generic implementation that can be used as is in any situation (zero sum two-player games) by providing a class that expects a simple Node interface for a Node.