Abstract
This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra’s, Prim’s, and Kruskal’s minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories. At last, we would account for the advantage of combining with these three graph theories and the game specifically.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Grimald, R.P.: Discrete And Combinatorial MatheMatics An Introduction, 5th edn. Addison Wesley, Reading (1994)
Lim, D.: Taking Students Out for a Ride: Using a Board Game to Teach Graph Theory. In: 38th SIGCSE technical symposium on Computer science education, pp. 367–371. ACM, Kentucky (2007)
Henney, A.J., Aqbiny, J.I.: Board Games of African Origin on Mobile Phones. In: IEE Mobility Conference 2005. The Second International Conference on Mobile Technology, Applications and Systems, pp. 1–8. Guangzhou (2005)
Goschnick, S., Balbo, S.: Game-first Programming for Information Systems Students. In: Second Australasian Conference on Interactive Entertainment, pp. 71–74. Creativity & Cognition Studios Press, Sydney (2005)
Komisarczuk, P., Welch, I.: A Board Game for Teaching Internet Engineering. In: 8th Austalian conference on Computing education, vol. 52, pp. 117–123. ACM, Hobart (2006)
WIKIPEDIA for Minimum Spanning Tree, http://en.wikipedia.org/wiki/Minimum_spanning_tree
James, F.K., Keith, W.R.: Computer Networking A Top-Down Approach Featuring the Internet, 3rd edn. Addison-Wesley, Reading (2004)
Mathematical Programming in Teaching Dijkstra’s Minimum Spanning Tree, http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml
Mathematical Programming in Teaching Prim’s Minimum Spanning Tree, http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Prim.shtml
Mathematical Programming in Teaching Kruskal’s Minimum Spanning Tree, http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/kruskal/Kruskal.shtml
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, WC., Chiu, YD., Li, MF. (2008). Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game. In: Li, F., Zhao, J., Shih, T.K., Lau, R., Li, Q., McLeod, D. (eds) Advances in Web Based Learning - ICWL 2008. ICWL 2008. Lecture Notes in Computer Science, vol 5145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85033-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-85033-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85032-8
Online ISBN: 978-3-540-85033-5
eBook Packages: Computer ScienceComputer Science (R0)