Given a 2D grid of integers of size ($3 \times 3$), where each value represents the number of stones in the given cell, return the minimum number of moves required to place exactly one stone in each grid cell.

Constraints:

• Only one stone can be moved in one move.

• Stone from a cell can only be moved to another cell if they are adjacent (share a side).

• The sum of all stones in the grid must be equal to $9$.

• grid.length, grid[i].length $== 3$

• $0 \le$ grid[i][j] $\le 9$

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 main.py in the following coding playground.