Each player uses a minimax algorithm (with alpha-beta pruning to reduce infeasible brances of the game tree in order to reduce the size of the search space). Player X and player Y each have their own ...