Material Detail

Treasure Hunt: Finite-State Automata

Treasure Hunt: Finite-State Automata

In this computer science activity about finite-state automaton (on page 45 of the PDF), learners use a map and choose various pathways to find Treasure Island. They learn that different pathways will lead them to dead-ends, continuous circles, or to their goal. This activity includes a simpler demonstration activity and one whole class activity. Background information about finite-state automaton and computer programming is included.



  • Peer Review
  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material


Log in to participate in the discussions or sign up if you are not already a MERLOT member.