八皇后问题 c# 实现

最新推荐文章于 2021-08-18 17:19:23 发布
最新推荐文章于 2021-08-18 17:19:23 发布
阅读量762 收藏
点赞数
分类专栏： c# 文章标签： c# pair class string
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/netfuns/article/details/3923860
版权

 代码：

 using System;
using System.Collections.Generic;
using System.Text;

namespace EightQueen
{
    class Program
    {
        static void Main(string[] args)
        {
            InitBoard(board);
            HasPlacedQueen(0, 0, 0);
            PrintBoard();
            Console.Read();
        }

        static int N=8;

        static char[,] board = new char[N, N];
        private static int HasPlacedQueen(int locX, int locY, int queenNum)
        {
            int result = 0;
            if (queenNum == N)           
                return 1;
            else
                if (CanPlaceQueen(locX, locY))
                {
                    board[locX, locY] = 'q';
                    /
                    for (int i = 0; i < N; i++)                   
                        for (int j = 0; j < N; j++)
                        {
                            result += HasPlacedQueen(i, j, queenNum + 1);
                            if (result > 0)
                            {
                                break;
                            }
                        }

                        if (result > 0)                      
                            return 1;                       
                        else
                        {
                            board[locX, locY] = 'x';
                            return 0;
                        }                 

                }
                else               
                    return 0;              
           
        }

        private static bool CanPlaceQueen(int locX, int locY)
        {      

            int i = 0, j = 0;

            if (board[locX, locY] != 'x')
            {
                return false;
            }

            上方
            for (j = locY - 1; j >= 0; j--)
            {
                if (board[locX, j] != 'x')
                {
                    return false;
                }
            }

            下方
            for (j = locY + 1; j < N; j++)
            {
                if (board[locX, j] != 'x')
                {
                    return false;
                }
            }

            左方
            for (i = locX - 1; i >= 0; i--)
            {
                if (board[i, locY] != 'x')
                {
                    return false;
                }
            }

            右边
            for (i = locX + 1; i < N; i++)
            {
                if (board[i, locY] != 'x')
                {
                    return false;
                }
            }

            左上方
            i=locX-1;
            j = locY - 1;
            while (i >= 0 && j >= 0)
            {
                if (board[i--,j--] != 'x')
                {
                    return false;
                }
            }

            右上方
            i = locX + 1;
            j = locY - 1;
            while (i < N && j >= 0)
            {
                if (board[i++,j--] != 'x')
                {
                    return false;
                }
            }

            左下方
            i = locX - 1;
            j = locY + 1;
            while (i >= 0 && j < N)
            {
                if (board[i--,j++] != 'x')
                {
                    return false;
                }

            }

            i = locX + 1;
            j = locY + 1;
            while (i < N && j < N)
            {
                if (board[i++,j++] != 'x')
                {
                    return false;
                }
            }

            return true;        
        
        }

        private static void InitBoard(char [,] board)
        {
            for (int i = 0; i < N; i++)
            {
                for (int j = 0; j < N; j++)
                {
                    board[i, j] = 'x';
                }
            }
       
        }

        private static void PrintBoard()
        {
            for (int i = 0; i < N; i++)
            {
                Console.Write("  " + i + "  ");
            }
            Console.WriteLine();

            for (int i = 0; i < N; i++)
            {
                Console.Write(" "+ "---");
            }
            Console.WriteLine();

            for (int i = 0; i < N; i++)
            {
                Console.Write(" " + i);
                for (int j = 0; j < N; j++)
                {
                    Console.Write("-{0}-|", board[i, j]);
                }
                Console.WriteLine();
                //Console.Write("+");
                //for (int k = 0; k < N; k++)
                //{
                //    Console.Write("---+");
                //}
                //Console.WriteLine();
               
           
            }

        
        }

 


    }
}

 

 

 

 

//非递归

 

using System;
using System.Collections.Generic;
using System.Text;

namespace EightQueen
{
    class Program
    {
        static int N = 2;
        static char[,] board = new char[N, N];
        static Stack<Pair> queenStack = new Stack<Pair>();
        public class Pair
        {
            public int x;
            public int y;
            public Pair(int a, int b)
            {
                x = a;
                y = b;
            }
        }

        static void Main(string[] args)
        {          

            InitBoard(board);
            TryPlaceQueen();
            PrintBoard();
            Console.Read();
        }      

      
        private static void TryPlaceQueen()
        {
           

            Pair current = new Pair(0, 0);
            Pair nextPair = new Pair(0, 0);
            while (queenStack.Count < N)
            {
                current = nextPair;

                if (CanPlaceQueen(current.x, current.y))
                {
                    queenStack.Push(current);
                    board[current.x, current.y] = 'Q';
                    nextPair = GetNextLine(current);
                    continue;


                }
                else
                {                                                              
                        while(current.y ==N-1 && queenStack.Count>0)
                      
                        {
                            current = queenStack.Pop();
                            board[current.x, current.y] = 'x';                           
                        }

                        nextPair = GetNext(current);                  
                }
            }

            while (queenStack.Count > 0)
            {
                Pair queen = queenStack.Pop();
                board[queen.x, queen.y] = 'Q';
            }         

        }

        private static Pair GetNext(Pair current)
        {
            Pair target = new Pair(current.x, current.y);
            int targetY = current.y + 1;
            if (targetY == N)
            {
                target.x += 1;
                target.y = 0;
            }
            else
            {
                target.y += 1;
            }          
           
            return target;
        }

        private static Pair GetNextLine(Pair current)
        {
            Pair target = new Pair(current.x,current.y);

            target.x = current.x + 1;
            target.y = 0;

            return target;
        }

      

        private static int HasPlacedQueen(int locX, int locY, int queenNum)
        {
            int result = 0;
            if (queenNum == N)           
                return 1;
            else
                if (CanPlaceQueen(locX, locY))
                {
                    board[locX, locY] = 'q';
                    /
                    for (int i = 0; i < N; i++)                   
                        for (int j = 0; j < N; j++)
                        {
                            result += HasPlacedQueen(i, j, queenNum + 1);
                            if (result > 0)
                            {
                                break;
                            }
                        }

                        if (result > 0)                      
                            return 1;                       
                        else
                        {
                            board[locX, locY] = 'x';
                            return 0;
                        }                 

                }
                else               
                    return 0;              
           
        }

        private static bool CanPlaceQueen(int locX, int locY)
        {      

            int i = 0, j = 0;

            if (board[locX, locY] != 'x')
            {
                return false;
            }

            上方
            for (j = locY - 1; j >= 0; j--)
            {
                if (board[locX, j] != 'x')
                {
                    return false;
                }
            }

            下方
            for (j = locY + 1; j < N; j++)
            {
                if (board[locX, j] != 'x')
                {
                    return false;
                }
            }

            左方
            for (i = locX - 1; i >= 0; i--)
            {
                if (board[i, locY] != 'x')
                {
                    return false;
                }
            }

            右边
            for (i = locX + 1; i < N; i++)
            {
                if (board[i, locY] != 'x')
                {
                    return false;
                }
            }

            左上方
            i=locX-1;
            j = locY - 1;
            while (i >= 0 && j >= 0)
            {
                if (board[i--,j--] != 'x')
                {
                    return false;
                }
            }

            右上方
            i = locX + 1;
            j = locY - 1;
            while (i < N && j >= 0)
            {
                if (board[i++,j--] != 'x')
                {
                    return false;
                }
            }

            左下方
            i = locX - 1;
            j = locY + 1;
            while (i >= 0 && j < N)
            {
                if (board[i--,j++] != 'x')
                {
                    return false;
                }

            }


            右下
            i = locX + 1;
            j = locY + 1;
            while (i < N && j < N)
            {
                if (board[i++,j++] != 'x')
                {
                    return false;
                }
            }

            return true;        
        
        }

        private static void InitBoard(char [,] board)
        {
            for (int i = 0; i < N; i++)
            {
                for (int j = 0; j < N; j++)
                {
                    board[i, j] = 'x';
                }
            }
       
        }

        private static void PrintBoard()
        {
            for (int i = 0; i < N; i++)
            {
                Console.Write("  " + i + "  ");
            }
            Console.WriteLine();

            for (int i = 0; i < N; i++)
            {
                Console.Write(" "+ "---");
            }
            Console.WriteLine();

            for (int i = 0; i < N; i++)
            {
                Console.Write(" " + i);
                for (int j = 0; j < N; j++)
                {
                    Console.Write("-{0}-|", board[i, j]);
                }
                Console.WriteLine();
           
            }

        
        }

 


    }
}

超级飞侠
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
用C#语言实现八皇后问题
Paul的博客
07-09 3616
C#实现八皇后问题
八皇后问题（c#)
weixin_33904756的博客
06-27 589
都是老掉牙的东西了。写这篇只是整理下自己的思路。不知道八皇后问题的见 百度文库 分析1： 　　何为横向、纵向、斜向不冲突？ 前两个很容易理解。斜向呢？翻译成数学就是任意两个皇后所在的位置所形成的线（两点一线）的斜率不能为1或者-1； 　　如何遍历整个棋盘？ 最简单的就是八重循环来遍历每行。再在重循环中遍历改行的每一列。 　　模拟放置： 遍历第0行，先放置（0,0）位置 判断安全； 　　　...
C#八皇后问题源代码
08-19
C#代码编写的解决八皇后问题，代码简洁明了。
八皇后问题（C#版）
weixin_30607659的博客
09-28 199
算法： using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks; namespace 八皇后{ 　　class Program 　　{ 　　　　int sum = 0; //定义是八皇后算法结果第几...
C#写八皇后
hanhandeguajian的博客
08-18 404
C#写八皇后 引言 刚开始接触到C#是因为想要用Unity自己做游戏 ，把脑海里的创意落到屏幕前。 而所有的Unity教程里都是从C#起步，所以就想好好学门C# 任务 这是老师布置的作业： 2.3 在8X8格的国际象棋棋盘上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上。请输出尽可能多的摆法。 环境 Visual stdio 2019 思路 为了对棋盘的布局有个清晰地了解，我们可以这样想：任意两个皇后不能在同一行，那么就说明一行放一个皇后，那么只要找到每行的皇后分别放在
八皇后问题的C#解答(转)
csdn864883的博客
07-06 231
改编自V星[视窗王子]应答程序，如下： using System;class Queen{const int SIZE = 8;//皇后数public static void Main(){int[] Queen = new i...
C#中八皇后问题的递归解法——N皇后
aab438346的博客
11-14 185
百度测试部2015年10月份的面试题之——八皇后。 八皇后问题的介绍在此。以下是用递归思想实现八皇后-N皇后。 代码如下： using System;using System.Collections.Generic; namespace QueensSolution { class Program { static int coun...
C# 用回溯递归解决“八皇后”问题
架构设计
03-27 297
C# 用回溯递归解决“八皇后”问题 　　在很早以前，我曾经用C++写过一篇使用回溯法来生成随机数独的博客。这一次，考虑到这是一系列关于C#的博客，所以利用C#的一些特点，来解决著名的“八皇后”问题。 　　一、问题概述 　　问题概述搬自百度百科。八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8X8格的国际象棋棋盘上摆放八个皇后...
基于C#实现8八皇后问题
12-10
基于C#实现8八皇后问题，控制台显示全部情况，回溯算法实现
c# 解决面向对象八皇后问题的实例
朱朱家园
11-07 1273
<br />using System;<br />using System.Collections.Generic;<br />using System.Linq;<br />using System.Text;<br />namespace eightqueen<br />{<br />   <br />    class Queen<br />    {<br />        private int row;<br />        private int column;<br />       
八皇后问题（C#）
weixin_30877755的博客
04-20 174
八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 using System; using System.Collections.Generic; using System.Linq; usin...
八皇后问题的C#解答
QQMagicer的专栏
04-02 1184
using System; class Queen{ const int SIZE = 8;//皇后数 public static void Main() { int[] Queen = new int [SIZE];//每行皇后的位置 int y,x,i,j,d,t=0; y = 0; Queen[0] = -1; while( true ) { for (x=Queen[y]+1; x{ fo
C# 解决八皇后问题
陈言必行 -- Unity游戏开发领域优质博主
07-25 822
八皇后 static void Main(string[] args) {   Console.ReadLine();   ChessSort(0, new int[8]);   Console.ReadLine(); }         public static bool Compare(int lastChess, int difference, int nowChess)
c#Func简单使用
热门推荐
每天进步一点点
08-14 1万+
private Func TestFun() { Func fun = k => k.ToUpper(); return fun; } private Func HandderCondition() { Func kk = (x, w) => x.Length >
c#委托-多播委托
xie__jin__cheng的博客
06-26 249
代码 using System; class A{ public int mA = 0; public void add(int a){ mA=mA+a; } public void cheng(int a){ mA = mA*a; } } class ag{ static void Main(string[] args){ Console.WriteLine("Hello...
逆转单链表c#模拟实现
netfuns的专栏
04-09 1456
  ///      /// 模拟单链表     ///     class LinkNode    {        public object data;        public LinkNode next;        public LinkNode(object adata)        {            this.data = adata;        }    }
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值