Question 125
A knight moves on a two-dimensional grid. From any square, it can move 2 units in one axis-parallel direction, then move 1 unit in an orthogonal direction, the way a regular knight moves in a game of chess. The knight starts at the origin. As it moves, it keeps track of a number $t$, which is initially $0$. When the knight lands at the point $(a, b)$, the number is changed from $x$ to $a x + b$.
Show that, for any integers $a$ and $b$, it is possible for the knight to land at the points $(1, a)$ and $(-1, a)$ with $t$ equal to $b$.
Show that, for any integers $a$ and $b$, it is possible for the knight to land at the points $(1, a)$ and $(-1, a)$ with $t$ equal to $b$.