12.
Xiao Ming wrote a program to move a robot on a
2×2 chessboard, as shown in the figure. In each execution, the program chooses one of the directions "up, down, left, right" with equal probability, and instructs the robot to move one square in that direction. However, if the chosen direction would cause the robot to move off the chessboard, the robot remains in place for that execution. Each execution starts from the robot's previous position and moves according to the newly chosen direction. Suppose the initial position of the robot is at
A. Let the probabilities that the robot is at
A,
B,
C, and
D after the program is executed
n times be
an,
bn,
cn, and
dn, respectively. Choose the correct option(s).

Figure 1
(1)
b1=41 (2)
b2=81 (3)
a2+d2=43 (4)
b99=c99 (5)
a100+d100>21This question has an AI blackboard walkthrough with narration, playable on the web or in the app.