Generation of a large variety of 3-dimensional maze problems with a genetic algorithm

Authors:
Ryujiro Akashi;Yoshiji Fujiimoto
Affiliations:
Department of Applied Mathematics and Informatics, Faculty of Science and Technology, Ryukoku University;Department of Media Informatics, Faculty of Science and Technology, Ryukoku University, Seta Ohtsu Shiga, Japan
Venue:
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Year:
2006

Citing 5
Cited 0

Creative evolutionary systems

Creative evolutionary systems
Evolutionary Design by Computers with CDrom

Evolutionary Design by Computers with CDrom
Forking Genetic Algorithm with Blocking and Shrinking Modes (fGA)

Proceedings of the 5th International Conference on Genetic Algorithms
Towards a genetic algorithms approach to designing 3D polygonal tree models

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Forking genetic algorithms: Gas with search space division schemes

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.