你能帮我解决一下关于foward链接的伪代码来解决n-queens问题吗？ [英] Can you help me with a pseudo code about foward chaining to solve the n-queens problem?

问题描述

你能帮我解决一个关于foward链接的伪代码来解决n-queens问题吗？

请帮助我

Can you help me with a pseudo code about foward chaining to solve the n-queens problem?
Please help me

推荐答案

这是你的功课，所以请给我们一些努力。您可以在网上找到有关正向链接算法和n皇后问题的许多可用文档（例如使用 Google ：forward chaining algorithm [ ^ ]，n皇后问题 [ ^ ]）。

阅读文档，了解问题，算法和事件盟友开始编码。当您遇到困难时，请在此处发布具体问题。

This is your homework so please show us some effort. You may find online many available documents on both forward chaining algorithm and n queens problem (for instance using Google: "forward chaining algorithm" [^], "n queens problem"[^]).
Read the documents, understand well both the problem and the algorithm and eventually start coding. Post here specific questions when you are stuck.

这篇关于你能帮我解决一下关于foward链接的伪代码来解决n-queens问题吗？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！