From Alife Agents to a Kingdom of N Queens

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
13 pages, 9 figures, in 1999 international conference of Intelligent Agent Technology. Nominated for the best paper award

Keywords

Artificial Intelligence, Data Structures and Algorithms, Multiagent Systems, I.2.8;I.2.11;G.2.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31095

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0205016
 http://arxiv.org/abs/cs/0205016
 in Jiming Liu and Ning Zhong (Eds.), Intelligent Agent Technology: Systems, Methodologies, and Tools, page 110-120, The World Scientific Publishing Co. Pte, Ltd., Nov. 1999

Collections

arXiv