public Space[] returnUnvisitedNeighbors(){
	/* where 0 is the top one, 1 is the one to the right, and proceed clockwise*/
	int size=0;
	Space[] n=getNeighbors();
	for (int i=0;i<n.length;i++){
	    if (!(n[i]==null)){
		if (!(n[i].isVisited()))
		    size++;
	    }
	}

	Space[] ret=new Space[size]; 
	int j=0;
	for (int i=0;i<n.length;i++){
	    if (!(n[i]==null)){
		if (!(n[i].isVisited())){
		    ret[j]=n[i];
		    j++;
		}
	    }
	}
	return ret;
    }