You are given an $8 imes 8$ matrix board representing a chessboard containing empty squares and chess pieces:

• Exactly $1$ white rook denoted by 'R'

• Zero or more white bishops denoted by 'B'

• Zero or more black pawns denoted by 'p'

• Empty squares denoted by '.'

A rook can move any number of squares horizontally or vertically across four directions (up, down, left, and right) until it reaches the edge of the board or another piece:

• If the rook encounters a black pawn 'p', it can capture that pawn, and movement in that direction terminates.

• If the rook encounters a white bishop 'B', its movement is blocked, and it cannot capture any piece further in that direction.

Return the total number of pawns the rook can capture.

Constraints:

• board.length $= 8$

• board[i].length $= 8$

• board[i][j] is either 'R', '.', 'B', or 'p'

• There is exactly $1$ cell where board[i][j] == 'R'

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.