Hey guys,

I have a 2 dimension 8 by 8 array which is fill with "." and 2 Xs. I need to find the shortest possible path from one X to another X recursivley. Can anyone help me to find the solution please? Thanks in advance. Here is the array which i've:

Code:char grid[][8] = { {'.','.','.','.','.','.','.','.'}, {'.','.','.','.','.','.','.','.'}, {'.','.','.','.','.','.','.','.'}, {'.','.','.','X','.','.','.','.'}, {'.','.','.','.','.','.','.','.'}, {'.','.','.','.','.','X','.','.'}, {'.','.','.','.','.','.','.','.'}, {'.','.','.','.','.','.','.','.'} };