Academic Journals Database
Disseminating quality controlled scientific knowledge

Solving the Puzzle Problem using a Multiagent Approach

Author(s): Kamel Khoualdi | Marwan El-Haj Mahmoud

Journal: World of Computer Science and Information Technology Journal
ISSN 2221-0741

Volume: 1;
Issue: 8;
Start page: 346;
Date: 2011;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: multiagent systems | puzzle problem | reactive agents | search methods.

Toys problems, such as the puzzle problem, are solved using classical artificial intelligence search algorithms Such as Breadth-first search and depth-first search. These strategies requires the generation of a graph known as the state space search that consist of the different states a problem may have. Using the above search techniques, a solution of the problem consists of a systematic exploration of the different state, starting from an initial state and moving towards a final state. This approach is time and memory consuming.In this paper, we propose a multiagent approach as an alternative to solve the puzzle problem. Each block in the puzzle is considered as a reactive agent. The paper shows how the solution is reached through the interaction of the agents.

Tango Jona
Tangokurs Rapperswil-Jona

     Save time & money - Smart Internet Solutions