Evolutionary agents for n-queen problems

Authors:
Weicai Zhong;Jing Liu;Licheng Jiao
Affiliations:
Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China;Institute of Intelligent Information Processing, Xidian University, Xi'an, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 4
Cited 0

Autonomous agents and multi-agent systems: explorations in learning, self-organization and adaptive computation

Autonomous agents and multi-agent systems: explorations in learning, self-organization and adaptive computation
Multi-agent oriented constraint satisfaction

Artificial Intelligence
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem

IEEE Transactions on Knowledge and Data Engineering
A multiagent genetic algorithm for global numerical optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel algorithm, Multi-Agent Evolutionary Algorithm for n-Queen Problem (MAEAqueen), is proposed. In MAEAqueen, all agents live in a latticelike environment, with each agent fixed on a lattice-point. In order to increase energies, they compete with their neighbors, and they can also use knowledge. Theoretical analyses show that MAEAqueen has a linear space complexity. In the experiments, a comparison is made between MAEAqueen and the existing method based on agents. The results show that MAEAqueen outperforms the other method. Furthermore, to study the time complexity of MAEAqueen, the 104~107-queen problems are used. The results show that MAEAqueen has a linear time complexity. Even for 107-queen problems, it can find the exact solutions only by 150 seconds.