34 On the $x O y$ coordinate plane, there is a Chinese chess "knight" at the origin $(0,0)$. Now, this "knight" is to jump to $P(1991,1991)$ according to the chess movement rules. The minimum number of jumps the knight must make is
A. 1329
B. 1328
C. 1327
D. 1325
34 B. To minimize the number of jumps for the "knight" to move from the origin to point $P(1991,1991)$, it is evident that the "knight" must jump in the direction of increasing both the x-coordinate and the y-coordinate. Each jump increases the sum of the x-coordinate and y-coordinate by 3, and the sum of the x-coordinate and y-coordinate of point $P$ is 3982. Therefore, the number of jumps $d \geqslant \frac{3982}{3}=1327+$ $\frac{1}{3}$, which means $d \geqslant 1328$.
On the other hand, if the "knight" jumps 665 times in the "two horizontal, one vertical" pattern and 665 times in the "one horizontal, two vertical" pattern, it will take 1327 jumps to reach point $Q(1992,1989)$. From point $Q$ to point $P$, it is clear that only one more jump is needed. Therefore, the minimum number of jumps from the origin to point $P$ is 1328.