Which is NOT a legal sentence in a formal language?

What is the alpha (α) value?

The following shows a three-player  (red, green, and blue) game (non-zero-game). Each player maximizes their own utility at their node. The bottom squares contain utility values for all three players (red colour values for the red player, green colour values for the green player, and blue colour values for the blue player). Which utility values (square) will the red player choose? (Assume that all the players will play optimally.)

According to the Alpha-Beta pruning algorithm, which subtree (path) will be pruned?

What is the time complexity of the Alpha-Beta pruning when the order of the game tree is perfect?

m: max depth; b: number of legal moves at each point

Which is NOT true about the properties of the minmax algorithm?

Which is NOT true about games (adversary)? (compared to search with no adversary)

What should be in the blanks in the following algorithm?

According to the Minimax strategy (algorithm), what value will the Max player choose at the root in the following game tree?

Which is NOT one of the typical AI assumptions about adversarial search (zero-sum games)?