Here is a sample of my new maze generation routines, the code is inspired
in manual pages of xscreensaver's mace (by various authors)
 Is posible to reach every part of the map.
Warning!: This is badly written C code, long periods of exposition
to this material will give neural damage.

int maze_level (int level) {
    int i,j,k=0;
    coord hedges[731+1]; /* Dirty hack!!! SHOULD BE CHANGED! to use defines*/
	/*Use de +1 as a buffer to swap values*/
    int group[(LEVELWIDTH-2)*(LEVELHIGHT-2)/4]; /*now,390*/
    /* fist i create the stairs*/
    i=myrand((LEVELWIDTH-2)/2);i=i*2+1;
    j=myrand((LEVELHIGHT-2)/2);j=j*2+1;
    clear_tile (i,j,level,'>');
    while (map[i][j][level]=='>') {
        i=myrand((LEVELWIDTH-2)/2);i=i*2+1;
	j=myrand((LEVELHIGHT-2)/2);j=j*2+1;
    }
    clear_tile (i,j,level,'<');
    /* carve basic holes */
    for (i=1;i<LEVELWIDTH-1;i++) {
	for (j=1;j<LEVELHIGHT-1;j++) {
	    if ((j%2)&&(i%2)) {
		clear_tile (i,j,level,'.');
		group[k]=k;  /*Initialize groups*/
	    	k++; /*390 now*/
	    }
	}
    }
    k=0;
    /* memorize hedges coords */
    for (i=1;i<LEVELWIDTH-2;i++) {
	for (j=1;j<LEVELHIGHT-2;j++) {
	    if (((j%2)&&(!(i%2)))||((!(j%2))&&(i%2))){
		hedges[k].x=i; 
		hedges[k].y=j; 
		/*clear_tile (i,j,level,'X');*/
		k++;
	    }
	}
    }
	/*Debug*/if (k!=731) die ("Maze generation, wrong hedge number");
    /* Randomize! Swap some hedges in the list*/
    for (i=0;i<731;i++) {
	j=myrand(731); k=myrand(731);
	hedges[731].x=hedges[k].x;
	hedges[731].y=hedges[k].y;
	hedges[k].x=hedges[j].x;
	hedges[k].y=hedges[j].y;
	hedges[j].x=hedges[731].x;
	hedges[j].y=hedges[731].y;
    }

    for (i=0;i<731;i++) {
/*	printf ("Hedge %i,%i\n",hedges[i].x,hedges[i].y);*/
	if (hedges[i].x>LEVELWIDTH-2 || hedges[i].y>LEVELHIGHT-2) die ("Maze generation, Hedge coords");
	if (hedges[i].y%2) {
	    j=((hedges[i].x-2)/2)+(((hedges[i].y-1)/2)*39);
	    k=j+1;
	    if (group[j]!=group[k]) {
	    	unitegroups(group[j],group[k],group);
		if (myrand(20)) {
		    clear_tile (hedges[i].x,hedges[i].y,level,'.');
		} else {make_door (hedges[i].x,hedges[i].y,level);}
	    }
	} else {
	    j=((hedges[i].x-1)/2)+(((hedges[i].y-2)/2)*39);
	    k=j+39;
	    if (group[j]!=group[k]) {
	    	unitegroups(group[j],group[k],group);
		if (myrand(20)) {
		    clear_tile (hedges[i].x,hedges[i].y,level,'.');
		} else {make_door (hedges[i].x,hedges[i].y,level);}
	    }
	}
    }
    return 1;
}


void unitegroups(int j,int k,int * group) {
    int i,l;
    l=min(j,k);
	/*Debug*/if (k>389 || j>389) die ("Maze generation, unitegroup");
    for (i=0;i<((LEVELWIDTH-2)*(LEVELHIGHT-2)/4);i++) {
	if (group[i]==j|| group[i]==k) group[i]=l;
    }
}


This is a smaple ouput

################################################################################
#.......#.......#.......#.'.......#.....#.......#.#.#.........+.#...#.....#.#.##
###.#.#####.#.#.#####.###.###########.###.#.#####.#.###.#######.#.#.#####.#.#.##
#...#.#.+...#.#...#.....#.#.........#.....#.+.#.......#.#.#.#.....#.......#.#.##
#.#.#######.#####.#####.#.#####.###.#######.###.#####+#.#.#.#.#.#######.#.#.#.##
#.#.......#...#.........#.#...#...#.........#.#...#...#...#...#.#.......#.....##
#.#####.#####.#.#.###.###.###.#.#####.#######.#+#.###.#.###.#######.###.###.####
#.....#...#...#.#.#.........#...#.#.....#.#.....#.#...#.#...#...#.....#.#.....##
#####.#+#########.#.#######.#.###.#.#####.###.#######.###.#####.################
#...#.#.#...#...#.#.#...#.......#.....#...#...#.#.#...#.#.........+.#.........##
#.#.###.#.#.#.###.###.#.###.#.#.#.#.#.###.###.#+#.###+#.#.#########.#.#####.####
#.#.......#.#.....#.#.#...#.#.#.#.#.#.#...#.#.....#.....#...#<..........#.....##
#.#.#####.#####.#.#.#####.###.#########.###.#.#.#########.#####.#######.#####.##
#.#.#.#.#.......#.#...#.#.#.....#.......#.....#.......+.#.+.#...#.........#...##
#.###.#.#.#####.###.###.#+#####.#.#.###.#.#.#+#.###.###.#.###.#.#######.#.#.####
#.#.....#.#...#.............#..>#.#.#.....#.#.#...#.#.......#.#.#...#...#.#...##
#.###.#.#+#.#####.#.###.#####.###.#######.#####.#.#.#######.#.#####.#######.#.##
#.#.#.#.......#...#...#.#.#...'.....+.#.#.....#.#.#.......#.#.#.#...#.#.....#.##
###.###+#####.#######.#.#.#.#####.###.#.#####.###.#########.#.#.#.###.###.###.##
#.......#...........#.#...#.....#...#.....#...#.........#...#...........#...#.##
################################################################################
################################################################################