Question 12
A gem-collecting game has a robot and the branching map shown.
Starting at “Xuất phát” (Start), the robot moves continuously. At each fork, its controller chooses a branch. At a dead end, it collects all gems there. Alex and Bob alternate decisions, with Alex moving first. Alex wants as many gems as possible; Bob wants as few as possible. Both know the other's goal and reason optimally. How many gems will the robot collect?
Starting at “Xuất phát” (Start), the robot moves continuously. At each fork, its controller chooses a branch. At a dead end, it collects all gems there. Alex and Bob alternate decisions, with Alex moving first. Alex wants as many gems as possible; Bob wants as few as possible. Both know the other's goal and reason optimally. How many gems will the robot collect?