八皇后c语言实现递归回溯

c语言实现的八皇后，采用的是递归回溯法intmain(){shortintqueen[MAX+1][MAX+1];memset(queen,0,sizeof(queen));eightqueen(1,queen);printf("共有%d种棋盘的摆放方式\n",count);return0;}