You are given a $2 \times 3$ integer grid board representing a sliding puzzle. The grid contains the numbers from $0$ to $5$, where 0 denotes the empty space. In one move, you may swap 0 with one of its adjacent cells that shares an edge with it.

The puzzle is considered solved when board becomes [[1,2,3],[4,5,0]]. Return the minimum number of moves required to reach the solved configuration. If it is impossible, return $-1$.

Constraints:

• board.length == 2

• board[i].length == 3

• $0 \leq$ board[i][j] $\leq 5$

• Each value board[i][j] is unique.

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.