MAXLEVEL
if (dlevel <= 0 || dlevel > MAXLEVEL)
if (newlevel > MAXLEVEL)
newlevel = MAXLEVEL; /* strange ... */
boolean level_exists[MAXLEVEL + 1];
if (lev >= 0 && lev <= MAXLEVEL)
if (newlevel > MAXLEVEL)
newlevel = MAXLEVEL;
for (i = 1; i <= MAXLEVEL; i++) { /* try to remove all */
if (k > 1 && (rnd(17) <= 4 || k == MAXLEVEL - 1 || k == MAXLEVEL + MAXVLEVEL - 1))
if (k != MAXLEVEL - 1) {
if (k < MAXLEVEL) {
if (k != MAXLEVEL - 1) {
if (k != MAXLEVEL - 1)
if (k != MAXLEVEL + MAXVLEVEL - 1)
if (k < MAXLEVEL)
if ((lv == MAXLEVEL - 1) || (lv == MAXLEVEL + MAXVLEVEL - 1) || rnd(13) == 2) {
if (lv == MAXLEVEL - 1 || lv == MAXLEVEL + MAXVLEVEL - 1)
if (j == MAXLEVEL) /* volcano shaft up from the temple */
if ((j > 0) && (j != MAXLEVEL - 1) && (j != MAXLEVEL + MAXVLEVEL - 1))
if ((j > 1) && (j != MAXLEVEL))
if ((j != MAXLEVEL - 1) && (j != MAXLEVEL + MAXVLEVEL - 1))
char beenhere[MAXLEVEL + MAXVLEVEL] = { 0 }; /* 1 if have been on this level */
for (p = 0; p < MAXLEVEL; p++)
lwrite((char *)beenhere, MAXLEVEL + MAXVLEVEL);
for (k = 0; k < MAXLEVEL + MAXVLEVEL; k++)
lrfill((char *)beenhere, MAXLEVEL + MAXVLEVEL);
for (k = 0; k < MAXLEVEL + MAXVLEVEL; k++)
for (j = 0; j < MAXLEVEL + MAXVLEVEL; j++) {
cell = malloc(sizeof(struct cel) * (MAXLEVEL + MAXVLEVEL) * MAXX * MAXY);
if (lvl < 0 || lvl > MAXLEVEL + MAXVLEVEL) /* correct level? */
if (level < 0 || level > MAXLEVEL + MAXVLEVEL) /* correct level? */
if (level < MAXLEVEL + MAXVLEVEL - 1)
if (level < MAXLEVEL + MAXVLEVEL - 1) /* not on V3 */
if (level == MAXLEVEL - 1)
else if (level == MAXLEVEL + MAXVLEVEL - 1)
newcavelevel(MAXLEVEL);
if ((level == MAXLEVEL - 1) || (level == MAXLEVEL + MAXVLEVEL - 1)) {
else if (level < MAXLEVEL) {
if (tmp >= MAXLEVEL)
tmp = MAXLEVEL - 1;
if (tmp >= MAXLEVEL + MAXVLEVEL)
tmp = MAXLEVEL + MAXVLEVEL - 1;
if (tmp < MAXLEVEL)
tmp = MAXLEVEL;
scores[i].hs_level > MAXLEVEL)
#define NLEVELS (MAXLEVEL + 1)
level = (int)strtonum(optarg, MINLEVEL, MAXLEVEL,
MINLEVEL, MAXLEVEL);
struct sbuf *sbuf[MAXLEVEL];
if (++mt->level == MAXLEVEL) {