<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Miguel A. Martínez-del-Amor</style></author><author><style face="normal" font="default" size="100%">Ignacio Pérez-Hurtado</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving the N-Queens puzzle with P systems </style></title><secondary-title><style face="normal" font="default" size="100%">7th Brainstorming Week on Membrane Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/02/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.gcn.us.es/?q=node/414</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Fénix Editora</style></publisher><pub-location><style face="normal" font="default" size="100%">Sevilla, España</style></pub-location><volume><style face="normal" font="default" size="100%">I</style></volume><pages><style face="normal" font="default" size="100%">199-210</style></pages><isbn><style face="normal" font="default" size="100%">978-84-613-2837-6</style></isbn><abstract><style face="normal" font="default" size="100%">The N -queens puzzle consists on placing N queens on an N × N grid in such
way that no two queens are on the same row, column or diagonal line. In this paper we
present a family of P systems with active membranes (one P system for each value of N )
that provides all the possible solutions to the puzzle.
</style></abstract></record></records></xml>