Skip to main content
SpringerLink
Log in

Generation of a Large Variety of 3-Dimensional Maze Problems with a Genetic Algorithm

  • Conference paper
Simulated Evolution and Learning (SEAL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4247))

Included in the following conference series:

  • 1442 Accesses

Abstract

This study generates a large variety of 3-dimensional maze (3-D maze) problems with a range of through-path lengths by a genetic algorithm. The 3-D mazes consist of 27 cubes containing a T-shaped cavity stacked into a 3× 3 × 3 cube. When the cubes are stacked with the appropriate orientations, a 3-D maze is formed by the cavities. About 2,000 3-D maze problems with through-path lengths from 18 to 54 segments (two segments per cube) were generated by the genetic algorithm using two evaluation functions generating long and short path lengths respectively.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bentley, P. (ed.): Evolutionary Design by Computer. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  2. Bentley, P.J., Corne, D.W. (eds.): Creative Evolutionary System. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  3. Eby, D., Averill, R., Gelfand, B., Punch, W.: An Injection Island GA for Flywheel Design Optimization. In: 5thEuropian Congress on Intelligent Techniques and Soft Computing FUFIT 1997, vol. 1, pp. 687–691. Verlag Mainz, Aachen (1997)

    Google Scholar 

  4. Funes, P., Pollack, J.: Computer Evolution of Buildable Objects. In: Fourth Europian Conference on Artificial Life, pp. 358–367. MIT Press, Cambridge (1997)

    Google Scholar 

  5. Mazza, R.H., Congdon, C.B.: Towards a Genetic Algorithms Approach to Design 3D Polygonal Tree Models. In: The 2002 IEEE Congress on Evolutionary Computation Proceedings, vol. 2, pp. 1842–1847 (2002)

    Google Scholar 

  6. Tsutsui, S., Fujimoto, Y.: Forking Genetic Algorithm with Blocking and Shrinking Modes. In: Proc. 5th ICGA, pp. 206–213 (1993)

    Google Scholar 

  7. Tsutsui, S., Fujimoto, Y., Ghosh, A.: Forking Genetic Algorithms: GA with Search Space Division Schemes. Evolutionary Computation 5(1), 61–80 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Informatics, Faculty of Science and Technology, Ryukoku University,  

    Ryujiro Akashi

  2. Department of Media Informatics, Faculty of Science and Technology, Ryukoku University, Seta Ohtsu Shiga, Japan

    Yoshiji Fujiimoto

Authors
  1. Ryujiro Akashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiji Fujiimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung County Taiwan, ROC

    Tzai-Der Wang

  2. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  3. AI-ECON Research Center, Department of Economics, National Chengchi University, 11623, Taipei, Taiwan

    Shu-Heng Chen

  4. Department of Computer Science and Technology, University of Sci. & Tech. of China, 230026, Hefei, Anhui, P.R. China

    Xufa Wang

  5. School of Information Technology and Electrical Engineering, University of New South Wales, Australian Defence Force Academy, Canberra, Australia

    Hussein Abbass

  6. The Univertity of Tokyo, Japan

    Hitoshi Iba

  7. Department of Computer, University of Science and Technology of China, 230027, Hefei, China

    Guo-Liang Chen

  8. University of Birmingham, Birmingham, UK

    Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akashi, R., Fujiimoto, Y. (2006). Generation of a Large Variety of 3-Dimensional Maze Problems with a Genetic Algorithm. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_101

Download citation

  • DOI: https://doi.org/10.1007/11903697_101

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47331-2

  • Online ISBN: 978-3-540-47332-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation