Skip to main content
SpringerLink
Log in
SpringerLink
Log in

An N-Puzzle Solver Using Tissue P System with Evolutional Symport/Antiport Rules and Cell Division

  • Conference paper
  • First Online:
Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1048))

  • 1072 Accesses

Abstract

An N-puzzle is a sliding blocks game that takes place on a grid with tiles each numbered from 1 to N. Many strategies like branch and bound and iterative deepening are exist in the literature to find the solution of the puzzle. But, here, a different membrane computing algorithm also called P systems, motivated from the structure and working of the living cell has been used to obtain the solution. A variation of P system, called tissue P system with evolutional symport/antiport (TPSESA) rules, is used to solve the puzzle. It has been proved that the power of computation of TPSESA rules with membrane division is universal Turing computable. In this paper, a concept of dynamic membrane division is also considered so that it completely simulates the behavior of a living cell. On the basis of experiments performed on a sample of different instances, the proposed algorithm is very efficient and reliable. As far as the author is concerned, this is the first time, an N-Puzzle problem is solved using the framework of membrane computing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Paun, G.: Introduction to Membrane. Computing (2006). https://doi.org/10.1007/978-3-64256196-2

    Article  MATH  Google Scholar 

  2. Maroosi, A., Muniyandi, R.C.: Accelerated execution of P system with active membranes to solve the N-queens problem. Theor. Comput. Sci. 551, 39–54 (2014)

    Article  MathSciNet  Google Scholar 

  3. Alhazov, A., Pan, L., Paun, G.: Trading polarizations for labels in P systems with active membranes. IJISCE 3 (2010)

    Google Scholar 

  4. Alhazov, A., Freund, R.: Polarization less P systems with one active membrane. In: International Conference on Membrane Computing. Springer, Berlin (2015)

    Chapter  Google Scholar 

  5. Xiang, L., Xue, J.: Solving job shop scheduling problems by P system with active membranes. In: 7th International Conference on Intelligent Human-Machine Systems and Cybernetics. 978-1-4799-8646-0/15 $ 31.00. IEEE (2015)

    Google Scholar 

  6. Song, B., Zhang, C., Pan, L.: Tissue -like P systems with evolutional symport/antiport rules. Elsevier 378, 177–193 (2017)

    Article  MathSciNet  Google Scholar 

  7. Bhasin, H., Singla, N.: Modified genetic algorithms based solution to subset sum problem. IJARAI 1 (2012)

    Google Scholar 

  8. Hayes, R.: The Sam Loyd 15-Puzzle. Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-2001-24, p. 28 (2001)

    Google Scholar 

  9. Bauer, B.: The Manhattan Pair Distance Heuristic for the 15 Puzzle. Paderborn, Germany (1994)

    Google Scholar 

  10. Calabro, C.: Solving the 15-Puzzle (2005). http://cseweb.ucsd.edu/~ccalabro/essays/15_puzzle.pdf

  11. Pizlo, Z., Li, Z.: Solving combinatorial problems: The 15-puzzle. Mem. Cogn. 33(6), 1069 (2005)

    Article  Google Scholar 

  12. Felner, A., Adler, A.: Solving the 24 puzzle with instance dependent pattern databases. In: Proceedings of the Sixth International Symposium on Abstraction, Reformulation and Approximation (SARA05), pp. 248–260 (2005)

    Google Scholar 

  13. Felner, A., Korf, R.E., Hanan, S.: Additive Pattern Database Heuristics. J. Artif. Intell. Res. (JAIR) 22, 279–318 (2004)

    Article  MathSciNet  Google Scholar 

  14. Drogoul, A., Dubreuil, C.: A distributed approach to N-puzzle solving. In: Proceedings of the Distributed Artificial Intelligence, pp. 95–108 (1993)

    Google Scholar 

  15. Bhasin, H., Singla, N.: Genetic based algorithm for N-Puzzle problem. Int. J. Comput. Appl. (0975-8887), 51(22) (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Institute of Technology, Tiruchirappalli, Tamil Nadu, India

    Resmi RamachandranPillai & Michael Arock

Authors
  1. Resmi RamachandranPillai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Arock
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Resmi RamachandranPillai .

Editor information

Editors and Affiliations

  1. Department of Mathematics, National Institute of Technology Silchar, Silchar, Assam, India

    Kedar Nath Das

  2. Department of Mathematics, South Asian University, New Delhi, Delhi, India

    Jagdish Chand Bansal

  3. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  4. Department of Mathematics, Faculty of Science, Liverpool Hope University, Liverpool, UK

    Atulya K. Nagar

  5. School of Electrical Engineering, VIT University, Vellore, Tamil Nadu, India

    Ponnambalam Pathipooranam

  6. School of Electrical Engineering, VIT University, Vellore, Tamil Nadu, India

    Rani Chinnappa Naidu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

RamachandranPillai, R., Arock, M. (2020). An N-Puzzle Solver Using Tissue P System with Evolutional Symport/Antiport Rules and Cell Division. In: Das, K., Bansal, J., Deep, K., Nagar, A., Pathipooranam, P., Naidu, R. (eds) Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 1048. Springer, Singapore. https://doi.org/10.1007/978-981-15-0035-0_40

Download citation

Publish with us

Policies and ethics

Search

Navigation