Finite State Machine

Assume you are making a game where the Hero raids an Egyptian Tomb. And there are Mummies guarding the Pharaoh's treasure!

Mummy's behavior:

• Spend all of eternity wandering in tomb
• When Hero is close, search by wandering rapidly
• When Mummy sees Hero, chase directly towards Hero

Goal: create a finite state machine for the mummy's behavior.

1. Define states and behavior in each state

2. Define state transitions

3. Sketch out pseudo code for the transitions

   • Assume "close" is 100 meters (smell/sense)

   • Assume "see" is line of sight

4. Add a powerup for the Hero - the Ankh. The Ankh causes all Mummies in the pyramid to cower in fear for 5 seconds. Add states and transitions for the Ankh.

Hand-in

Have ONE person from each group submit the group's answers:

http://wpi.qualtrics.com/jfe/form/SV_dbrvKDqnzzsYPGZ

Make sure to include the names of all group members.

Happy state-machine-ing!

-- Mark