© Ì.S. Bogdanov, À.À. Shalyto
Saint-Petersburg State University of Information Technologies, Mechanics and Optics
Project documentation (in Russian)
The goal of this project is designing a game project and implementing it. This game is well known as Lode Runner. Its goal is to gather all gold bars while the enemies are trying to stop you.
Finite state machines are used for description of character's behavior and allow simplifying program's logic. There're two types of states: control states and computing states. A little number of control states can manage a big set of computing states.
Transition graphs are built for the control states (they describe the game logic).
Depending on the control state some functions are called and they define the character's behavior. Variables used in these functions can be in various states. The character can be in a large number of states in each control state.
1. Shalyto A.A., Tukkel N.I. From Turing programming to automata programming // Mir PK. 2002. #2, p.144-149 (http://is.ifmo.ru/works/).