Find Shortest Tile Moves

Question

A one-dimensional board is given as an array of tiles start. Every cell holds one of three values: "R" (a red tile), "B" (a black tile) or "_" (an empty cell). A red tile can never head anywhere but right, while a black tile always heads left. One move takes a single tile and does one of the following: ...