N皇后的递归解法C#实现

class Program
    {
        static void Main(string[] args)
        {
            int N = 6; //几阶的棋盘 一般是偶数 自己替换实验

            int[,] matrix = new int[N, N];

            Place(matrix, 0, N);
        }
        /// <summary>
        /// 将目标棋盘格清空
        /// </summary>
        /// <param name="r">起始行</param>
        /// <param name="n">棋盘边界</param>
        static void Clear(int[,] arr,int r,int n)
        {
            for (int i = r; i < n; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    arr[i, j] = 0;
                }
            }
        }
        /// <summary>
        /// 递归放置棋子
        /// </summary>
        /// <param name="arr">目标棋盘</param>
        /// <param name="r">目标行</param>
        /// <param name="n">N*N的棋盘</p