The TK village originally have no roads. One day, the chief decided that the people should no longer walk on muddy paths to one another's house. He wants to build roads on this village to allow his people to walk on proper paths. However, he wants to save money by laying the shortest lengths of road to connect the whole village. He has employed you to help him plan this road system as long as the least length of road is laid to connect up all the houses. The circles in this program are all the houses in this village and the numbers are the distance between the houses to one another. Click on the number to lay a road between two houses. Once you have connected all the houses, the chief will thank you with this message "Thank you, you have connected all the houses in the village!!!" The path length Now click on the green flag to start.
Activity modified from The Muddy City activity, created by the CS Education Research Group at the University of Canterbury, New Zealand, from CS Unplugged workbook pages 89-91 http://csunplugged.org/books/ This program was modified from the original version created by Moti Ben-Ari (Copyright 2010 by Moti Ben-Ari. This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License) downloaded from http://code.google.com/p/scratch-unplugged/
