Shown below in figure 1 is a layout of a chess board with one knight and several pawns. Given that the knight cannot land on any square that has a pawn, but can jump over it, the pawns cannot move, and the knight moves on a chess board as shown in figure 2, what is the least number of steps required for the knight to reach square x?