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

Author:

Čarapina Mia1ORCID,Staničić Ognjen1,Dodig Ivica12ORCID,Cafuta Davor12ORCID

Affiliation:

1. Department of Information Technology and Computing, Zagreb University of Applied Sciences, 10000 Zagreb, Croatia

2. Multimedia, Design and Application Department, University North, 42000 Varaždin, Croatia

Abstract

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.

Funder

Application of VR technology and neural networks in the field of computer security and digital forensics

Ministry of Science, Education, and Youth through EU funding

Publisher

MDPI AG

Reference44 articles.

1. Matthews, W.H. (1970). Mazes and Labyrinths: Their History and Development, Courier Corporation.

2. Robot programming intervention for promoting spatial relations, mental rotation and visual memory of kindergarten children;Brainin;J. Res. Technol. Educ.,2022

3. Coding, Robotics and Computational Thinking in Preschool Education: The Design of Magne-Board;Demir;Avrupa Bilim Teknol. Derg.,2021

4. Developing Computational Thinking with Educational Technologies for Young Learners;Ching;TechTrends,2018

5. Buck, J. (2015). Mazes for Programmers: Code your Own Twisty Little Passages, The Pragmatic Programmers, The Pragmatic Bookshelf.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3