4x4 Sliding puzzle solver

instead of a picture, you're given a 4x4 board with the following tiles

- 4 Orange Tiles (Represented as 0)

- 4 Yellow Tiles (Represented as 1)

- 3 Empty Spaces (Represented as 2)

- 5 Blank Tiles (Represented as 3)



Given a 2d array.

Board[Rows][Columns]

You'll have something like the following

[0, 3, 3, 1]

[2, 1, 1, 2]

[3, 2, 3, 0]

[0, 0, 3, 1]



The goal is to arrange all the yellow tiles into a single row and all the orange tiles into another row.

- It doesn't matter what row

- It doesn't matter where the Blank and Empty tiles end

- Any tile can be moved into an empty space