A finite state machine (fsm) is a graph in which vertices are represented by states and edges are represented by transition functions between states. In the programming world, the current state of the fsm machine decides what code will be executed. Transitions between states are instantaneous.

FSMs are very suitable for animation coding because they provide a clean way to switch between different animations and prevent undesired transitions from occurring. Roughly speaking, a state is represented by either an animation or a transition from one animation to another.

Last edited Feb 12, 2007 at 1:40 AM by dastle, version 1

Comments

No comments yet.