Computer Programming I Assignment 5 Bot Maze

/*****************************************
  Filename:cp1_hw5.c
  Author:Willy Chen(willychen.org)
  Date:2018.01.26
*****************************************/
#include<stdio.h>
#include<stdbool.h>
#define ROW 4+1
#define COLUMN 4+1

void DFS(bool maze[COLUMN][ROW],int *path,int x,int y,int start){
    /* jumps out-of-bounds */
    if(x<0||y<0||x==COLUMN-1||y==ROW-1)
        return;
    /* check all the places have been jumped */
    if(x==3&&y==0){
        int count=0;
        for(int i=0;i<ROW-1;i++){
            for(int j=0;j<COLUMN-1;j++){
                if(maze[i][j]==false)
                    count++;
            }
        }
        if(!count){
            (*path)++;
            return;
        }
        return;
    }
    /* the place has been jumped */
    if(maze[x][y]==true&&start==true)
        return;
    maze[x][y]=true;

    /* jumps up, down, right, left */
    DFS(maze,path,x+1,y,true);
    DFS(maze,path,x-1,y,true);
    DFS(maze,path,x,y+1,true);
    DFS(maze,path,x,y-1,true);

    if(maze[x][y]==true&&start==true)
        maze[x][y]=false;

    return;
}

int main(){
    bool maze[COLUMN][ROW]={0};

    /* input the map */
    for(int i=0; i<COLUMN; i++){
        for(int j=0; j<ROW; j++){
            maze[i][j]=false;
        }
    }

    /* obstacle location */
    int x,y;
    while(scanf("%d,%d",&x,&y)!=EOF){
        maze[x][y]=true;
    }
    maze[0][0]=true;
    maze[3][0]=true;

    int path =0;
    /* calculate the paths */
    DFS(maze,&path,0,0,false);

    printf("path:%d\n",path);
    return 0;
}