Help

int fastest;
do{
    for(i=0;i<sumi;i++){
            for(j=0;j<sumj;j++){
                possible[i][j]=array[i][j];
            }
    }
    if(turn==0){
        fastest=0;//where 0 is self
        for(i=0;i<players;i++){//finds the fastest
            if(path[i]<path[fastest]){//set obstacles
                fastest = i;
            }
        }
        if(fastest!=0){
            //call obstacles
        }
    }

}while (turn!=4);