为什么我的i还是*，看来好多遍了！

#include<iostream>
#include<vector>
#include<unordered_map>

using namespace std;
const int N = 110;
char a[N][N];
int n;
int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
struct node {
    int x;
    int y;
};
vector<node> q;
bool st[N][N];
unordered_map<char, char> p;

void dfs(int x, int y, int k, char now, int fx, int fy) {
    if (now == 'g') {
        for (int i = 0; i < q.size(); i++) {
            auto t = q[i];
            int nx = t.x;
            int ny = t.y;
            st[nx][ny] = true;
        }
        return;
    }
    if (k == 0) {
        for (int i = 0; i < 8; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if (nx >= 1 && nx <= n && ny >= 1 && ny <= n && a[nx][ny] == 'i') {
                node temp;
                temp.x = nx;
                temp.y == ny;
                q.push_back(temp);
                dfs(nx, ny, 1, 'i', dx[i], dy[i]);
                q.pop_back();
            }
        }
    } else {
        int nx = x + fx;
        int ny = y + fy;
        if (nx >= 1 && nx <= n && ny >= 1 && ny <= n && a[nx][ny] == p[now]) {
            node temp;
            temp.x = nx;
            temp.y = ny;
            q.push_back(temp);
            dfs(nx, ny, 1, a[nx][ny], fx, fy);
            q.pop_back();
        }
    }

}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            cin >> a[i][j];
    p['y'] = 'i';
    p['i'] = 'z';
    p['z'] = 'h';
    p['h'] = 'o';
    p['o'] = 'n';
    p['n'] = 'g';
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            if (a[i][j] == 'y') {
                node temp;
                temp.x = i;
                temp.y = j;
                q.push_back(temp);
                dfs(i, j, 0, 'y', 0, 0);
                q.pop_back();
            }
        }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (!st[i][j])
                a[i][j] = '*';
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            cout << a[i][j];
        cout << endl;
    }


    return 0;
}