int maze::wallType(position pos) {
    size_t i = pos.x, j = pos.y;
    if (i != 0 && i != nrow - 1 && j != 0 && j != ncol - 1) {
        if (f[i][j + 1] == WALL
            && f[i][j - 1] == WALL
            && f[i + 1][j] == WALL
            && f[i - 1][j] == WALL) {
            return 974;
        } else if ((f[i][j + 1] == WALL
                    || f[i][j - 1] == WALL)
                   && f[i + 1][j] != WALL
                   && f[i - 1][j] != WALL) {
            return 973;
        } else if (f[i][j + 1] != WALL
                   && f[i][j - 1] != WALL
                   && (f[i + 1][j] == WALL
                       || f[i - 1][j] == WALL)) {
            return 954;
        } else if (f[i][j + 1] != WALL
                   && f[i][j - 1] == WALL
                   && f[i + 1][j] != WALL
                   && f[i - 1][j] == WALL) {
            return 956;
        } else if (f[i][j + 1] != WALL
                   && f[i][j - 1] == WALL
                   && f[i + 1][j] == WALL
                   && f[i - 1][j] != WALL) {
            return 955;
        } else if (f[i][j + 1] == WALL
                   && f[i][j - 1] != WALL
                   && f[i + 1][j] == WALL
                   && f[i - 1][j] != WALL) {
            return 969;
        } else if (f[i][j + 1] == WALL
                   && f[i][j - 1] != WALL
                   && f[i + 1][j] != WALL
                   && f[i - 1][j] == WALL) {
            return 968;
        } else if (f[i][j + 1] == WALL
                   && f[i][j - 1] == WALL
                   && f[i + 1][j] == WALL
                   && f[i - 1][j] != WALL) {
            return 971;
        } else if (f[i][j + 1] == WALL
                   && f[i][j - 1] == WALL
                   && f[i + 1][j] != WALL
                   && f[i - 1][j] == WALL) {
            return 970;
        } else if (f[i][j + 1] == WALL
                   && f[i][j - 1] != WALL
                   && f[i + 1][j] == WALL
                   && f[i - 1][j] == WALL) {
            return 972;
        } else if (f[i][j + 1] != WALL
                   && f[i][j - 1] == WALL
                   && f[i + 1][j] == WALL
                   && f[i - 1][j] == WALL) {
            return 953;
        }
    } else if (i == 0 && !(j == 0 || j == ncol - 1)) {
        if (f[i + 1][j] == WALL) {
            return 971;
        } else {
            return 973;
        }
    } else if (i == nrow - 1 && !(j == 0 || j == ncol - 1)) {
        if (f[i - 1][j] == WALL) {
            return 970;
        } else {
            return 973;
        }
    } else if (j == 0 && !(i == 0 || i == nrow - 1)) {
        if (f[i][j + 1] == WALL) {
            return 972;
        } else {
            return 954;
        }
    } else if (j == ncol - 1 && !(i == 0 || i == nrow - 1)) {
        if (f[i][j - 1] == WALL) {
            return 953;
        } else {
            return 954;
        }
    } else if (i == 0 && j == 0) {
        return 969;
    } else if (i == 0 && j == ncol - 1) {
        return 955;
    } else if (i == nrow - 1 && j == 0) {
        return 968;
    } else if (i == nrow - 1 && j == ncol - 1) {
        return 956;
    }