Imagine the following FSM, representing the brain of an ant carrying leaves home: The implementation of a FSM begins with the states and transitions it will have. Each edge has a label informing when the transition should happen, like the player is near label in the figure above, which indicates that the machine will transition from wander to attack if the player is near. The "brain" of an enemy, for instance, can be implemented using a FSM: every state represents an action, such as attack or evade:Īn FSM can be represented by a graph, where the nodes are the states and the edges are the transitions. Only a single state can be active at the same time, so the machine must transition from one state to another in order to perform different actions.įSMs are commonly used to organize and represent an execution flow, which is useful to implement AI in games. Note: Although this tutorial is written using AS3 and Flash, you should be able to use the same techniques and concepts in almost any game development environment.Ī finite-state machine, or FSM for short, is a model of computation based on a hypothetical machine made of one or more states. This tutorial describes the theory, implementation and use of simple and stack-based finite-state machines.Īll icons made by Lorc, and available on. It is perfect for implementing AI in games, producing great results without a complex code. A finite-state machine is a model used to represent and control execution flow.
0 kommentar(er)
