n皇后问题的回溯算法 [英] The Backtracking Algorithm for the n-Queens Problem

问题描述

我想要一个用c#完成的程序来解决n皇后问题的回溯算法.
我非常需要它.
我是yusef
谢谢.
电子邮件:[已删除电子邮件]

i want a complet program in c# for The Backtracking Algorithm for the n-Queens Problem.
i need very its.
i am yusef
thank you.
email : [Email Removed]

推荐答案

我是Marcus，但我没有为您做作业.我们在这里为您提供帮助，但通过提供消息来源，我们对您没有帮助.你尝试了什么?
绝对不要直接在问题中发布您的电子邮件，除非您当然喜欢将各种垃圾邮件装在盒子里. :)

I am Marcus, and I''m not doing your homework for you. We''re here to help you, and by providing source, we aren''t helping you. What have you tried?
Never, ever post your email directly in a question, unless of course you enjoy having your box filled with spam of all kinds. :)

没有人会为您编写代码.自己动手，如果您有问题，我们将为您解决该问题.

Nobody is going to write code for you. Do it yourself, and if you have a problem, we''ll help you with that problem.

由于在研究本帖提示之前已被问过: ^ ]

您可能还想尝试使用Google搜索！

祝您编程愉快！

最好的问候，
曼弗雷德(Manfred)

Since it has been asked before study the tips from this post: 8 queens solution via the hill climbing algorithm[^]

You might want to try googling for it also!

Happy coding!

Best Regards,
Manfred

这篇关于n皇后问题的回溯算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！