Identifying Ideal Move Positions in a 2D Array Using Scala

Hello, and welcome, code explorer! Today's journey takes us through the intricate paths within a 2-dimensional array, often likened to a game board. Our mission is to identify ideal spots for game piece placement. Sounds like an adventure, doesn't it? Let's embark!

Visualize a chessboard in the form of a 2D array, where each cell could be marked 'E' for empty or 'P' for a piece. Our quest involves summoning a Scala method named findPositions. Upon examining this 2D array, this method identifies all the spots where a new piece could be placed so that it can move to another empty cell in one move. The catch is that a piece can move only to an immediately neighboring cell directly above, below, to the left, or to the right, but not diagonally.

Consider this 4x4 board, for instance:

P E E P
E P E P
P E P P
P E P E

The method should render an output as: List((0, 1), (0, 2), (1, 2), (2, 1), (3, 1)). This output represents the positions where a new piece can fit perfectly and then be able to move in the next turn.

Stepping right into action, we start with an empty list positions to help us log the sought positions. Understanding the dimensions of our "board" paves the way for defining boundaries in our exploration mission. In Scala, array sizes can be determined using the .length property.

def findPositions(board: Array[Array[Char]]): List[(Int, Int)] = {
  var positions = List[(Int, Int)]()
  val rows = board.length
  val cols = board(0).length

With our boundary map, we begin our expedition across the board. We use two nested for expressions to traverse the entire board one cell at a time.

  for (i <- 0 until rows) {
    for (j <- 0 until cols) {
      // ensuing exploration

What's the plan for each cell, you ask? While exploring each cell, our trusty Scala code inspects if the cell is empty. If confirmed, it then peeks into the neighbors in the up, down, left, and right directions. If another vacant cell ('E') is spotted, we jot down the main cell's position in our positions list.

def findPositions(board: Array[Array[Char]]): List[(Int, Int)] = {
  var positions = List[(Int, Int)]()
  val rows = board.length
  val cols = board(0).length

  for (i <- 0 until rows) {
    for (j <- 0 until cols) {
      if (board(i)(j) == 'E') {
        if ((i > 0 && board(i - 1)(j) == 'E') || 
            (i < rows - 1 && board(i + 1)(j) == 'E') || 
            (j > 0 && board(i)(j - 1) == 'E') || 
            (j < cols - 1 && board(i)(j + 1) == 'E')) {
          positions = positions :+ (i, j)
        }
      }
    }
  }
  positions
}

// Example usage within the main function
val board = Array(
  Array('P', 'E', 'E', 'P'),
  Array('E', 'P', 'E', 'P'),
  Array('P', 'E', 'P', 'P'),
  Array('P', 'E', 'P', 'E')
)

println(findPositions(board)) // Prints List((0,1), (0,2), (1,2), (2,1), (3,1))