void findPath(int arr[10][10],int begin,int end)
{
        int BI1,BI2; //begin index 1 and begin index 2
        if (begin==end)
        {       arr[0][0]=10;
                return;
        }
        else
        {
                BI2=begin%10;
                BI1=(begin-BI2)/10;
                if (((BI1+1)<=9)&&(arr[BI1+1][BI2]==0))
                        findPath(arr,begin+10,end);
                if (((BI2+1)<=9)&&(arr[BI1][BI2+1]==0))
                        findPath(arr,begin+1,end);
                if (((BI2-1)>=0)&&(arr[BI1][BI2-1]==0))
                        findPath(arr,begin-1,end);
                if (((BI1-1)>=0)&&(arr[BI1-1][BI2]==0))
                        findPath(arr,begin-10,end);
        }
}

int main()
{
        int arr[10][10],i,j,begin,end;
        printf("Please enter 10*10 zeros or ones:\n");
        for (i=0;i<10;i++)
        {
        for (j=0;j<10;j++)
                    scanf("%d",&arr[i][j]);
    }
    printf("Please enter start point:\n");
        scanf("%d",&begin);
    printf("Please enter end point:\n");
                   scanf("%d",&end);
    findPath(arr,begin,end);
    if (arr[0][0]==10)
       printf("Path exists? Yes\n");
    else
        printf("Path exists? No\n");
        return 0;
}

struct Point
{
  int x;
  int y;
};

struct Path
{ 
  Point* points;
  int numPoints;
};

// return a pointer to a new path object if found, NULL if not
// Note: the calling function must free any memory returned by this function
Path *FindPath( int arr[10][10], Path *path, Point *current, Point *point) // find the point in the path
{
  // Create a copy of path.....we will call it newPath

  // Add current to newPath

  // have we found the point?
  if( current->x == point->x && current->y == point->y ) return newPath;

  // Right
  //  if the right square is a 0 and not on our path already, set current to the right square and call this function with the new path
  //  if it does not return NULL, you are done and should return it

  // Left

  // Up

  // Down

  // If we got here, we did not find the path
  return NULL;
}
 
}

void findPath(int arr[10][10], int begin, int end)
{
    static int depth = 0;
    int BI1, BI2;               /*begin index 1 and begin index 2 */
    printf("In findPath: depth =  %d, begin = %d, end = %d\n", ++depth,begin, end);
    if (begin == end) {
        --depth;
        arr[0][0] = 10;
        return;
    }
    else {
        BI2 = begin % 10;