You are given an $m imes n$ matrix seats representing a classroom seating arrangement, where:

• seats[i][j] == '.' represents an available seat.

• seats[i][j] == '#' represents a broken seat.

A student seated at position (i, j) can see the exam paper of any student seated in the following adjacent positions:

• Directly to the left: (i, $j - 1$ )

• Directly to the right: (i, $j + 1$ )

• Diagonally to the front left: (i - $1$ , $j - 1$ )

• Diagonally to the front right: (i - $1$ , $j + 1$ )

Students cannot see the papers of those sitting directly in front of them or behind them.

Return the maximum number of students who can take the exam simultaneously without any student being able to view another student’s work.

Constraints:

• seats contains only the characters '.' and '#'.

• $m ==$ seats.length

• $n ==$ seats[i].length

• $1 \leq m \leq 8$

• $1 \leq n \leq 8$

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.