First steps towards automatically defining the difficulty of maze-based programming challenges
| dc.contributor.author | Kanellopoulou, Ioanna | |
| dc.contributor.author | Garaizar, Pablo | |
| dc.contributor.author | Guenaga Gómez, Mariluz | |
| dc.date.accessioned | 2025-09-05T09:56:36Z | |
| dc.date.available | 2025-09-05T09:56:36Z | |
| dc.date.issued | 2021-04-22 | |
| dc.date.updated | 2025-09-05T09:56:36Z | |
| dc.description.abstract | In a world where algorithms are ubiquitous, the development of computational thinking competencies is becoming progressively important among students, technology professionals, and 21st-century citizens in general. Educational games as a means of promoting computational thinking skills have gained popularity in recent years. Offering efficient educational games that promote computational thinking competencies requires personalized learning paths through adaptive difficulty. The research presented herein is a first attempt to define a difficulty function for maze-based programming challenges using log data obtained from Kodetu, which is a block-based maze game. Specifically, we conducted three studies with 9- to 16-year-old students who were asked to solve sequences of maze-based programming challenges. Using log data from these studies, we investigated the maze characteristics and the coding limitations that affect performance in the challenges and calculated the performance obtained by the participants using a fuzzy rule-based system. The results showed that the turns in a maze, the number of total steps of a maze, and the blocks provided affect student performance. Using regression analysis, we defined a difficulty function for maze-based programming challenges that considers the weights of these factors and provides a first step towards the design of adaptive learning paths for computational thinking-related educational games. | en |
| dc.description.sponsorship | This work was supported by the European Union’s Horizon 2020 Research and Innovation Program through the Marie Sklodowska-Curie Grant under Agreement 665959 | en |
| dc.identifier.citation | Kanellopoulou, I., Garaizar, P., & Guenaga, M. (2021). First steps towards automatically defining the difficulty of maze-based programming challenges. IEEE Access, 9, 64211-64223. https://doi.org/10.1109/ACCESS.2021.3075027 | |
| dc.identifier.doi | 10.1109/ACCESS.2021.3075027 | |
| dc.identifier.eissn | 2169-3536 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14454/3515 | |
| dc.language.iso | eng | |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
| dc.subject.other | Block-based maze game | |
| dc.subject.other | Computational thinking | |
| dc.subject.other | Difficulty | |
| dc.subject.other | Educational games | |
| dc.title | First steps towards automatically defining the difficulty of maze-based programming challenges | en |
| dc.type | journal article | |
| dcterms.accessRights | open access | |
| oaire.citation.endPage | 64223 | |
| oaire.citation.startPage | 64211 | |
| oaire.citation.title | IEEE Access | |
| oaire.citation.volume | 9 | |
| oaire.licenseCondition | https://creativecommons.org/licenses/by/4.0/ | |
| oaire.version | VoR |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- kanellopoulou_first_2021.pdf
- Tamaño:
- 2.37 MB
- Formato:
- Adobe Portable Document Format