<p>On an <code>2 x 3</code> board, there are five tiles labeled from <code>1</code> to <code>5</code>, and an empty square represented by <code>0</code>. A <strong>move</strong> consists of choosing <code>0</code> and a 4-directionally adjacent number and swapping it.</p>

<p>The state of the board is solved if and only if the board is <code>[[1,2,3],[4,5,0]]</code>.</p>

<p>Given the puzzle board <code>board</code>, return <em>the least number of moves required so that the state of the board is solved</em>. If it is impossible for the state of the board to be solved, return <code>-1</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/06/29/slide1-grid.jpg" style="width: 244px; height: 165px;" />
<pre>
<strong>Input:</strong> board = [[1,2,3],[4,0,5]]
<strong>Output:</strong> 1
<strong>Explanation:</strong> Swap the 0 and the 5 in one move.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/06/29/slide2-grid.jpg" style="width: 244px; height: 165px;" />
<pre>
<strong>Input:</strong> board = [[1,2,3],[5,4,0]]
<strong>Output:</strong> -1
<strong>Explanation:</strong> No number of moves will make the board solved.
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/06/29/slide3-grid.jpg" style="width: 244px; height: 165px;" />
<pre>
<strong>Input:</strong> board = [[4,1,2],[5,0,3]]
<strong>Output:</strong> 5
<strong>Explanation:</strong> 5 is the smallest number of moves that solves the board.
An example path:
After move 0: [[4,1,2],[5,0,3]]
After move 1: [[4,1,2],[0,5,3]]
After move 2: [[0,1,2],[4,5,3]]
After move 3: [[1,0,2],[4,5,3]]
After move 4: [[1,2,0],[4,5,3]]
After move 5: [[1,2,3],[4,5,0]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>board.length == 2</code></li>
	<li><code>board[i].length == 3</code></li>
	<li><code>0 &lt;= board[i][j] &lt;= 5</code></li>
	<li>Each value <code>board[i][j]</code> is <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    vector<vector<int>>  perfectBoard ={{1,2,3},{4,5,0}} ;

    int recursion(queue<pair<vector<vector<int>>, int>> &myqueue, set<vector<vector<int>>> visited) {
        while(!myqueue.empty()){
            auto board = myqueue.front();
            myqueue.pop();
            if(board.first==perfectBoard){
                return board.second;
            }
            bool foundBoard = false;
            for (auto& v: visited) {
                if(v == board.first){
                foundBoard = true;
                break;
                }
            }
            visited.insert(board.first);

            if(foundBoard)
                continue;

            auto boardCopy = board.first;
            int row = 0, spalte = 0;
            bool found = false;
            for (; row < 2; row++) {
                spalte = 0;
                for (; spalte < 3; ++spalte) {
                    if(board.first[row][spalte]==0){
                        found = true;
                        break;
                    }
                }
                if(found)
                    break;
            }
            if(spalte+1<3){

                boardCopy[row][spalte] = boardCopy[row][spalte+1];
                boardCopy[row][spalte+1] = 0;
                bool foundBoard = false;
                for (auto& v: visited) {
                    if(v == boardCopy){
                        foundBoard = true;
                        break;
                    }
                }
                if(!foundBoard){
                    myqueue.push({boardCopy,board.second+1});
                    //move to left
                }
                boardCopy = board.first;

            }

            if(spalte-1>=0){
                boardCopy[row][spalte] = boardCopy[row][spalte - 1];
                boardCopy[row][spalte - 1] = 0;
                bool foundBoard = false;
                for (auto& v: visited) {
                    if(v == boardCopy){
                        foundBoard = true;
                        break;
                    }
                }
                if(!foundBoard) {
                    myqueue.push({boardCopy, board.second + 1});
                }
                boardCopy = board.first;

                //move left
            }

            if(row-1>=0){
                boardCopy[row][spalte] = boardCopy[row - 1][spalte];
                boardCopy[row - 1][spalte] = 0;
                bool foundBoard = false;
                for (auto& v: visited) {
                    if(v == boardCopy){
                        foundBoard = true;
                        break;
                    }
                }
                if(!foundBoard) {

                    // move down
                    myqueue.push({boardCopy, board.second + 1});
                }
                boardCopy = board.first;

            }


            if(row+1<2){
                bool foundBoard = false;
                boardCopy[row][spalte] = boardCopy[row + 1][spalte];
                boardCopy[row + 1][spalte] = 0;
                for (auto& v: visited) {
                    if(v == boardCopy){
                        foundBoard = true;
                        break;
                    }
                }
                if(!foundBoard) {

                    myqueue.push({boardCopy, board.second + 1});
                    //move up
                }
                boardCopy = board.first;

            }
        }
        return -1;
    }

    int slidingPuzzle(vector<vector<int>>& board) {
        int steps = 0, erg = INT16_MAX;
        if(board==perfectBoard){
            return 0;
        }
        queue<pair<vector<vector<int>>,int>> q{};
        auto boardCopy = board;
        int row = 0, spalte = 0;
        bool found = false;
        for (; row < 2; row++) {
            spalte = 0;
            for (; spalte < 3; ++spalte) {
                if(board[row][spalte]==0){
                    found = true;
                    break;
                }
            }
            if(found)
                break;
        }
        set<vector<vector<int>>> visited{};
        visited.insert(board);
        //move to right
        if(spalte+1<3){
            boardCopy[row][spalte] = boardCopy[row][spalte+1];
            boardCopy[row][spalte+1] = 0;
            q.push({boardCopy,1});
            boardCopy = board;
            //move to left
        }

        if(spalte-1>=0){
            boardCopy[row][spalte] = boardCopy[row][spalte-1];
            boardCopy[row][spalte-1] = 0;
            q.push({boardCopy,1});
            boardCopy = board;

            //move left
        }

        if(row-1>=0){
            boardCopy[row][spalte] = boardCopy[row-1][spalte];
            boardCopy[row-1][spalte] = 0;
            // move down
            q.push({boardCopy,1});
            boardCopy = board;

        }

        if(row+1<2){
            boardCopy[row][spalte] = boardCopy[row+1][spalte];
            boardCopy[row+1][spalte] = 0;
            q.push({boardCopy,1});
            boardCopy = board;
            //move up
        }

        return recursion(q, visited);

    }
};
16634