This is a script for solving Flow Free Android Game
After reading the game status,
we create a list of pairs [x1, y1, x2, y2] cell[x1, y1] and cell[x2, y2] have same color
and we want to find a path between cell [x1, y1] and cell [x2, y2]
without conflict between any other path or pass throw a colored cell except cells ([x1, y1], [x2, y2])
We just run a standard backtrack algorithm and try all possible paths