从Alive Agents到N皇后王国
From Alife Agents to a Kingdom of N Queens
摘要：
本文提出了一种求解N皇后问题的新方法，它涉及到一种带有人工生命的分布式自主智能体模型和一种在智能体环境中表示N皇后约束的方法。分布式代理与它们的生活环境进行本地交互，即，一个棋盘，并执行他们的反应行为，通过应用他们的行为规则的随机运动，最少冲突的位置搜索，并与其他代理合作等。基于代理的N皇后问题求解系统的发展，通过选择和竞争，根据适者生存的规则，其中一些代理将死亡或被吃掉，如果他们的移动策略是比别人效率低。实验结果表明，该系统能够解决大规模的N皇后问题。本文还提出了一种求解一般CSP问题的ALife Agent模型。
英文摘要：
This paper presents a new approach to solving N-queen problems, which involves a model of distributed autonomous agents with artificial life (ALife) and a method of representing N-queen constraints in an agent environment. The distributed agents locally interact with their living environment, i.e., a chessboard, and execute their reactive behaviors by applying their behavioral rules for randomized motion, least-conflict position searching, and cooperating with other agents etc. The agent-based N-queen problem solving system evolves through selection and contest according to the rule of Survival of the Fittest, in which some agents will die or be eaten if their moving strategies are less efficient than others. The experimental results have shown that this system is capable of solving large-scale N-queen problems. This paper also provides a model of ALife agents for solving general CSPs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
