--description--

Given the position of one of your pawns on a chessboard, return an array of all the valid squares it can move to in ascending order.

A standard chessboard is 8x8, with columns labeled A through H (left to right) and rows labeled 1 through 8 (bottom to top). It looks like this:

For this challenge:

• You are the player on the bottom of the board.
• Pawns can only move one square "up".
• Unless the pawn is in the starting row (row 2), then it can move one or two squares up.

For example, given "D4", return ["D5"], the only square your pawn can move to. Given "B2", return ["B3", "B4"], because it's on the starting row and needs to be in ascending order.

--hints--

findPawnMoves("D4") should return ["D5"].

assert.deepEqual(findPawnMoves("D4"), ["D5"]);

findPawnMoves("B2") should return ["B3", "B4"].

assert.deepEqual(findPawnMoves("B2"), ["B3", "B4"]);

findPawnMoves("A7") should return ["A8"].

assert.deepEqual(findPawnMoves("A7"), ["A8"]);

findPawnMoves("G2") should return ["G3", "G4"].

assert.deepEqual(findPawnMoves("G2"), ["G3", "G4"]);

findPawnMoves("E3") should return ["E4"].

assert.deepEqual(findPawnMoves("E3"), ["E4"]);

--seed--

--seed-contents--

function findPawnMoves(position) {

  return position;
}

--solutions--

function findPawnMoves(position) {
  const column = position[0].toUpperCase();
  const row = parseInt(position[1]);
  const moves = [];

  if (row >= 8) return moves;

  moves.push(`${column}${row + 1}`);

  if (row === 2) moves.push(`${column}${row + 2}`);

  return moves;
}