皇后问题

#include"iostream"
#include"windows.h"
using namespace std;

class Piece{
private:
    int *p;
    int n;
public:
    static int count;
    static char **map;
    
    //创建棋子
    Piece(int n);
    
    //创建棋盘
    void createMap(char bg,char piece);
    
    //打印棋盘
    void show();
    
    //判断棋子是否可放
    bool judge(int x);
    
    //移动棋子
    void move(int x);
};

int Piece::count = 0;
char **Piece::map;
int main(){
    char bg = '+';
    char pie = '#';
    int n = 8;
    Piece p(n);
    p.createMap(bg,pie);
    p.move(0);
    return 0;
}

Piece::Piece(int n){
    this->n = n;
    p = new int[n];
    for(int i = 0;i < n;i++){
        p[i] = -1;
    }
}
void Piece::createMap(char bg,char piece){
    map = new char*[n];
    for(int i = 0;i < n;i++){
        map[i] = new char[n];
    }
    for(i = 0;i < n;i++){
        for(int j = 0;j < n;j++){    
            map[i][j] = bg;
        }
    }
}

void Piece::show(){
    for(int i = 0;i < n;i++){
        for(int j = 0;j < n;j++){
            if(p[j] == i){
                cout<<"O"<<" ";
            }
            else{
                cout<<map[i][j]<<" ";
            }
        }
        cout<<endl;
    }
}

void Piece::move(int x){
    if(x<n){            //棋子在棋盘内
        for(int i = 0;i < n;i++){
            p[x] = i;
            if(judge(x)){            //棋子可以放
                if(x == n-1){
                    cout<<"-------"<<++count<<"-------"<<endl;
                    this->show();
                }
                move(x + 1);        //放下一个棋子
            }
            //棋子不能放，放下一个
        }
        //都不能放，不放，重新放上一个
        p[x] = -1;
    }
}
bool Piece::judge(int x){            //第x列
    int x1 = x + p[x];        //反斜线
    int x2 = x - p[x];        //正斜线
    for(int i = 0;i < n;i++){
        if(p[i]!=-1&&i!=x&&p[x] == p[i]){        //行
            return false;
        }
        if(x2+i!=x&&x2 + i>=0&&x2 + i<n&&p[x2 + i] != -1&&x2 + i - x == p[x2 + i] - p[x]){        //正斜线
            return false;
        }
        if(x1 - i!=x&&x1 - i>=0&&x1 - i<n&&p[x1 - i] != -1&&x1 - i - x == p[x] - p[x1 - i]){        //反斜线
            return false;
        }
    }
    return true;
}