Project Abstract

This project focuses on the development of educational games centered around backtracking algorithms, aiming to enhance learning and understanding among students in Grades 8 to 10 Backtracking algorithms, rooted in computer science history and pioneered by figures like Dijkstra, Bellman, and Knuth, serve as the backbone for problem-solving in various domains including AI, optimization, and software engineering. The project delves into the theoretical foundations and practical applications of backtracking algorithms, exploring optimization techniques and comparative analyses. By integrating backtracking algorithms into educational games, the project seeks to engage students in interactive problem-solving scenarios, fostering a deeper understanding of algorithmic concepts . The abstract encapsulates the significance of integrating gamified learning experiences with algorithmic education, contributing to advancements in teaching methodologies and interactive learning environments.

Keywords: Development of educational games, Backtracking algorithms are essential, Optimization techniques for algorithms

 Conference Details

Session: Presentation Stream 31 at Presentation Slot 6

Location: GH018 at Wednesday 8th 13:30 – 17:00

Markers: Gregory Cheng, Ehinafa Akinola (GTA)

Course: MSc Data Science, Masters PG

Future Plans: I’m looking for work