Wwise Help

Since it can be difficult, time-consuming, and very expensive to re-create every condition and outcome that exists in a game, you will want some kind of fallback mechanism to cover those situations you didn't think of or didn't have time to create. In Wwise, this is done by creating fallback paths. These fallback paths contain one or more state groups instead of states and are generally associated with more general pieces of dialogue. For example, in an RTS game, you might have situations where the outcome of a certain operation is uncertain, such as the final destination of your army. To cover this situation, you can create a path where at least one state group is used in place of a state. This path would then be assigned to a sound object that leaves the operation open-ended. In the case of your army on the way to its final destination, the sound object might be “Your army is advancing”.

Before creating the dialogue for a game, it is important that the scriptwriter understand how the fallback algorithm works in Wwise. Let's say you have a dialogue event with the following state groups and states:

When the dialogue event is called by the game, the algorithm will try to match the current condition in game, let's say (A1, B1, C1), with one of the paths in the dialogue event to determine which sound to play. When more than one path matches the current condition in game, the mode of the dialogue event will ultimately decide how Wwise picks a path and corresponding sound. When a dialogue event is in 'Best Match' mode, Wwise will look for an exact match by verifying the current condition in game against the paths created in the dialogue event. If no exact match is found or if the matching path doesn't have an associated piece of dialogue, the algorithm will look for the closest match among the fallback paths, if any.

When a dialogue event is in 'Weighted' mode, Wwise looks for all matches including all fallback paths. From this list of matches, it looks at the weighting of each path and from there determines which path to select and which piece of dialogue to play.

The following illustration shows how the 'best match' decision algorithm verifies all possible matches to determine which object to play.

Notice how the decision algorithm looks for fallbacks from right to left. In our example, it starts with C, then looks at B, and ends at A. The left-most fallback will only be considered when all other possible combinations are exhausted.

	Note
	You can also create a generic path for a dialogue event. The generic path covers all situations and ensures that a piece of dialogue will be played no matter which states are triggered by the game.