1 /* Copyright (c) Stichting Mathematisch Centrum, Amsterdam, 1985. */ 2 /* hack.mkmaze.c - version 1.0.2 */ 3 /* $FreeBSD: src/games/hack/hack.mkmaze.c,v 1.4 1999/11/16 10:26:37 marcel Exp $ */ 4 /* $DragonFly: src/games/hack/hack.mkmaze.c,v 1.2 2003/06/17 04:25:24 dillon Exp $ */ 5 6 #include "hack.h" 7 #include "def.mkroom.h" /* not really used */ 8 extern struct monst *makemon(); 9 extern struct permonst pm_wizard; 10 extern struct obj *mkobj_at(); 11 extern coord mazexy(); 12 struct permonst hell_hound = 13 { "hell hound", 'd', 12, 14, 2, 3, 6, 0 }; 14 15 makemaz() 16 { 17 int x,y; 18 int zx,zy; 19 coord mm; 20 boolean al = (dlevel >= 30 && !flags.made_amulet); 21 22 for(x = 2; x < COLNO-1; x++) 23 for(y = 2; y < ROWNO-1; y++) 24 levl[x][y].typ = (x%2 && y%2) ? 0 : HWALL; 25 if(al) { 26 struct monst *mtmp; 27 28 zx = 2*(COLNO/4) - 1; 29 zy = 2*(ROWNO/4) - 1; 30 for(x = zx-2; x < zx+4; x++) for(y = zy-2; y <= zy+2; y++) { 31 levl[x][y].typ = 32 (y == zy-2 || y == zy+2 || x == zx-2 || x == zx+3) ? POOL : 33 (y == zy-1 || y == zy+1 || x == zx-1 || x == zx+2) ? HWALL: 34 ROOM; 35 } 36 (void) mkobj_at(AMULET_SYM, zx, zy); 37 flags.made_amulet = 1; 38 walkfrom(zx+4, zy); 39 if(mtmp = makemon(&hell_hound, zx, zy)) 40 mtmp->msleep = 1; 41 if(mtmp = makemon(PM_WIZARD, zx+1, zy)) { 42 mtmp->msleep = 1; 43 flags.no_of_wizards = 1; 44 } 45 } else { 46 mm = mazexy(); 47 zx = mm.x; 48 zy = mm.y; 49 walkfrom(zx,zy); 50 (void) mksobj_at(WAN_WISHING, zx, zy); 51 (void) mkobj_at(ROCK_SYM, zx, zy); /* put a rock on top of it */ 52 } 53 54 for(x = 2; x < COLNO-1; x++) 55 for(y = 2; y < ROWNO-1; y++) { 56 switch(levl[x][y].typ) { 57 case HWALL: 58 levl[x][y].scrsym = '-'; 59 break; 60 case ROOM: 61 levl[x][y].scrsym = '.'; 62 break; 63 } 64 } 65 for(x = rn1(8,11); x; x--) { 66 mm = mazexy(); 67 (void) mkobj_at(rn2(2) ? GEM_SYM : 0, mm.x, mm.y); 68 } 69 for(x = rn1(10,2); x; x--) { 70 mm = mazexy(); 71 (void) mkobj_at(ROCK_SYM, mm.x, mm.y); 72 } 73 mm = mazexy(); 74 (void) makemon(PM_MINOTAUR, mm.x, mm.y); 75 for(x = rn1(5,7); x; x--) { 76 mm = mazexy(); 77 (void) makemon((struct permonst *) 0, mm.x, mm.y); 78 } 79 for(x = rn1(6,7); x; x--) { 80 mm = mazexy(); 81 mkgold(0L,mm.x,mm.y); 82 } 83 for(x = rn1(6,7); x; x--) 84 mktrap(0,1,(struct mkroom *) 0); 85 mm = mazexy(); 86 levl[(xupstair = mm.x)][(yupstair = mm.y)].scrsym = '<'; 87 levl[xupstair][yupstair].typ = STAIRS; 88 xdnstair = ydnstair = 0; 89 } 90 91 walkfrom(x,y) int x,y; { 92 int q,a,dir; 93 int dirs[4]; 94 levl[x][y].typ = ROOM; 95 while(1) { 96 q = 0; 97 for(a = 0; a < 4; a++) 98 if(okay(x,y,a)) dirs[q++]= a; 99 if(!q) return; 100 dir = dirs[rn2(q)]; 101 move(&x,&y,dir); 102 levl[x][y].typ = ROOM; 103 move(&x,&y,dir); 104 walkfrom(x,y); 105 } 106 } 107 108 move(x,y,dir) 109 int *x, *y; 110 int dir; 111 { 112 switch(dir){ 113 case 0: --(*y); break; 114 case 1: (*x)++; break; 115 case 2: (*y)++; break; 116 case 3: --(*x); break; 117 } 118 } 119 120 okay(x,y,dir) 121 int x,y; 122 int dir; 123 { 124 move(&x,&y,dir); 125 move(&x,&y,dir); 126 if(x<3 || y<3 || x>COLNO-3 || y>ROWNO-3 || levl[x][y].typ != 0) 127 return(0); 128 else 129 return(1); 130 } 131 132 coord 133 mazexy(){ 134 coord mm; 135 mm.x = 3 + 2*rn2(COLNO/2 - 2); 136 mm.y = 3 + 2*rn2(ROWNO/2 - 2); 137 return mm; 138 } 139