Minimax Playground

Minimax lets the computer brute-force all the possible moves to find the optimal ones. Given below are 2 examples

[1] The first mover can choose to expose only the odd, or only the even indices to the second mover, depending on which one has a greater total. Therefore, first mover can never lose.