Board Game Supporting Learning Prim's Algorithm and Dijkstra's Algorithm

  • Authors:

  • Wen-Chih Chang;Te-Hua Wang;Yan-Da Chiu

  • Affiliations:

  • Chung Hua University, Taiwan;Chihlee Institute of Technology, Taiwan;Chung Hua University, Taiwan

  • Venue:
  • International Journal of Multimedia Data Engineering & Management
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works. In this paper, the authors introduce a competitive board game to motivate students to learn the concept of minimum spanning tree algorithms. They discuss the reasons why it is beneficial to combine graph theories and board game for the Dijkstra and Prim minimum spanning tree theories. In the experimental results, this paper demonstrates the board game and examines the learning feedback for the mentioned two graph theories. Advantages summarizing the benefits of combining the graph theories with board game are discussed.