This is a chess board game. The board size 4x4. The game consists of two teams. One team has three member: A, B, C; On the other hand, The remaining one has members named: X, Y, Z. The winning conditions are one team eliminates the other one.
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.
Reference: https://en.m.wikipedia.org/wiki/Alpha–beta_pruning