- View more resources from this publisherComputer Science Unplugged
Treasure Hunt - Finite State Automata
The students’ goal in this resource is to find Treasure Island. Friendly pirate ships sail along a fixed set of routes between the islands in this part of the world, offering rides to travellers. Each island has two departing ships, A and B, which students can choose to travel on in order to find the best route to Treasure Island. Students use their map to keep track of where they are going and which ship they have travelled on. The resource begins with an introduction to the treasure hunt by way of a demonstration of the task. Photocopy masters for use with the demonstration and the activity are provided. This activity is followed up with the 'mysterious coin game'. To conclude there is more information about finite state automata followed by solutions and hints. This collection of twenty activities from Computer Science Unplugged is designed to aid the teaching and learning of computer science through engaging games and puzzles using cards, string, crayons and lots of running around.
Show health and safety information
Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.
Downloads
-
Treasure hunt - finite state automata 298.18 KB