[vhsqygpv] getting to nearby squares with a knight

getting a chess knight from (0,0) to (0,1), simulating a wazir move, takes minimum 3 moves (this is well known).  moving from (0,0) to (2,2), an alfil move, requires 4 moves.  it is very safe to be two diagonal steps away from an opposing knight.

knight simulating ferz (1,1) or dabbaba (0,2): 2 moves.

shortest closed circuit ("simulating" a stone): 2 moves.  closed circuits always take an even number of moves.  for every even number, there exists a closed circuit of that length.