1 of 5

Treasure Hunt!

2 of 5

Example

Rules:

  • These are friendly pirates, but not helpful! Don’t give away where a ship goes!
  • Each island has two departing ships, you only find out where it is going once you board.
  • Use the map to keep track of where you’ve been.

3 of 5

Treasure Hunt!

4 of 5

What’s the quickest route?

How do you know?

5 of 5

How might computers use this skill?

Finite-state automata are used to help a computer process a sequence of events.

​

Some examples:

  • Press 1 for...Press 2 for….Press 3 for the operator… (simple)
  • Chatbot (more complex)
  • User-interface design