Gamified Learning Approach for Pedagogical Notebooks

28 views
Skip to first unread message

Lungsom Lamnio

unread,
Mar 9, 2025, 10:00:49 AMMar 9
to NumFOCUS GSOC

Hi Mentors,


I hope you’re doing well! My name is Lungsom Lamnio, and I’m a second-year student, Python developer, and GSoC 2025 aspirant excited about contributing to NetworkX. I have experience working with graph algorithms and web development, and I’ve previously explored network graphs for traffic optimization in AI-based Smart Traffic Management Systems. Additionally, I serve as the Web Dev Lead at Google Developers Group (GDG) on Campus, where I contribute to developer communities and mentor students in web technologies.


I came across the Pedagogical Interactive Notebooks idea, and I’d love to contribute by making learning graph algorithms more engaging and interactive. Instead of just explaining algorithms, I propose a Gamified Learning Approach—where users actively solve challenges and visualize how algorithms work, making the learning process more hands-on and fun!


Key Features of My Approach:


Graph Puzzles & Quizzes – Step-by-step challenges where users solve graph-related problems before moving to the next concept.

Simulations – Users can manipulate graphs dynamically and observe algorithms in action.

Graph Adventure Game – A learning module where users control a robot navigating a network of nodes, solving shortest path problems (Dijkstra’s algorithm) or optimizing network flow (Ford-Fulkerson).

Graph Maze Generator – An interactive notebook where users must find the exit using DFS/BFS, reinforcing their understanding of traversal algorithms.


I believe this approach will make learning graph algorithms more engaging while bridging the gap between theory and real-world applications. I’d love to hear your thoughts on this idea and any guidance on where I should start!


Looking forward to your response. 😊


Best,

Lungsom Lamnio

Web Dev Lead, Google Developers Group (GDG) on Campus

Reply all
Reply to author
Forward
0 new messages