A Comparative Study of Maze Generation Algorithms in a Game-Based Mobile Learning Application for Learning Basic Programming Concepts

This study evaluates several maze generation algorithms applied to generate mazes in a game-based Android mobile application designed to support children in learning basic programming concepts and computational thinking. Each algorithm is assessed for its ability to generate solvable and educational...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Algorithms Ročník 17; číslo 9; s. 404
Hlavní autori: Čarapina, Mia, Staničić, Ognjen, Dodig, Ivica, Cafuta, Davor
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.09.2024
Predmet:
Algorithms
Applications programs
Cognition & reasoning
Comparative studies
Complexity
computational thinking
Computer & video games
Computer science
Critical thinking
Design
Efficiency
game-based learning
Games
Independent study
Learning strategies
Machine learning
maze generation
Maze learning
mazes
mobile applications
Mobile communications networks
Mobile computing
Problem solving
Programming languages
Robotics
Robots
School environment
Skills
Structural reliability
Toys
Wireless telephone software
ISSN:1999-4893, 1999-4893
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This study evaluates several maze generation algorithms applied to generate mazes in a game-based Android mobile application designed to support children in learning basic programming concepts and computational thinking. Each algorithm is assessed for its ability to generate solvable and educationally effective mazes, varying in complexity and size. Key findings indicate that Wilson’s and Aldous–Broder algorithms were identified as the most time inefficient. In comparison, Sidewinder and Binary Tree algorithms perform best for smaller mazes due to their straightforward traversal methods. The Hunt-and-Kill and Recursive backtracker algorithms maintain higher ratios of longest paths, making them suitable for the more complex maze generation required for advanced game levels. Additionally, the study explores various maze-solving algorithms, highlighting the efficiency of the recursive algorithm for simpler mazes and the reliability of Dijkstra’s algorithm across diverse maze structures. This research underscores the importance of selecting appropriate maze generation and solving algorithms to balance generation speed, path complexity, and navigational characteristics. While the study demonstrates the practical applicability of these algorithms in a mobile educational application, it also identifies limitations and suggests directions for future research.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a17090404