In Reversi, at each step what can be the maximum number of moves possible? I want to implement Min-Max Tree.
Also, what would be the case if I want to implement NxN reversi.