...it's like TV Tropes, but LINKED DATA!
Algorithmic Story Branching
- 112 statements
- 21 feature instances
- 6 referencing feature instances
| Algorithmic Story Branching | type |
FeatureClass | |
| Algorithmic Story Branching | label |
Algorithmic Story Branching | |
| Algorithmic Story Branching | page |
AlgorithmicStoryBranching | |
| Algorithmic Story Branching | comment |
Most Story Branching in Video Games follows the classic Gamebook model of "choose X for branch A, or choose Y for branch B". More sophisticated narrative games implement Event Flags to delay a specific decision payoff ("if you chose X earlier, event A occurs now"); multiple event flags can then be combined into a full Choice-and-Consequence System, and made arbitrarily complex with Promptless Branching Points, a Branch-and-Bottleneck Plot Structure, etc. All of these tropes, however, fundamentally rely on Boolean algebra: Each player choice is its own true/false variable, and at every branching point, the devs must choose relevant variables and assign a specific outcome to every possible instantiation thereof ("if you chose X earlier or say Y now, event A occurs; otherwise, B occurs, unless you also chose Z, then C occurs"). As you can imagine, the complexity of this sub-system grows exponentially, the more choices the player can make. This trope is about an alternative approach that aggregates numbers from various events and compares them instead of relying on single choices. So, when the time comes for the plot to branch, the game checks these numbers and selects a branch based either on whether some value is in a specific, writer-defined range, or on which score is the highest at that point. This approach gives narrative designers a lot of expressive power by letting them add new meaningful player choices without having to explicitly account for every possible combination. Another benefit is that choices can now be weighted, with some being assigned larger numeric modifiers than others, thus having a larger, but not dominant effect on the story. An additional common pattern in this approach are pre-authored priority lists that order the outcomes from most to least likely and can, for instance, serve as tie-breakers. Subtrope of Story Branching. Supertrope to Alignment-Based Endings — at least, to the variation where the ending choice is based on the final Karma Meter standing, rather than a Last-Second Ending Choice. Relationship Values can also be used as input values for this approach. Also compare Secret Expanded Epilogue. |
|
| Algorithmic Story Branching | fetched |
2023-04-17T15:57:11Z | |
| Algorithmic Story Branching | parsed |
2023-04-17T15:57:11Z | |
| Algorithmic Story Branching | isPartOf |
DBTropes | |
| Algorithmic Story Branching / int_1077f3ae | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_1077f3ae | comment |
Triangle Strategy: The Scales of Conviction subsystem branches your story (e.g. Lord Serenoa's decision to surrender or to defend Prince Roland in Chapter VII) based on a simple majority vote among his main seven Player Party allies, rather than the player directly choosing one branch or the other. Each party member has a preferred branch, but Serenoa can attempt to persuade some of them via dialogue to change their vote note though whether his persuasion attempt has been successful is not revealed until the vote actually takes place, with his own (i.e. the player's) vote serving as a tie-breaker in an even split. | |
| Algorithmic Story Branching / int_1077f3ae | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_1077f3ae | featureConfidence |
1.0 | |
| Triangle Strategy (Video Game) | hasFeature |
Algorithmic Story Branching / int_1077f3ae | |
| Algorithmic Story Branching / int_1aacbbc9 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_1aacbbc9 | comment |
Dragon Age: Dragon Age: Origins: A minor example occurs late in the game, when the Warden and Arl Eamon's party calls for a Landsmeet to challenge Loghain's legitimacy as regent. Depending on which side quests you have completed, which allies you've won, and which arguments you bring to the final debate, points are added or subtracted to a hidden meter (with some allies, like Queen Anora and the Grand Cleric, mattering more than others). As long as it ultimately stands at 5+, the Landsmeet will move to depose Loghain; otherwise, the nobles will stand by him. As he refuses to give up power peacefully, either way, you will have to fight him, but deposing him legally allows you to do so in an honorable duel and even to subsequently recruit him into the Grey Wardens. Dragon Age: Inquisition: At the start of the game, the current Divine of the Chantry dies, and towards the end, three high-ranking members of the Inquisition announce their claims as her successors. As explained in-depth here, each candidate has a hidden score (independent of the regular Relationship Values) that starts out at 0 at the beginning of the game and goes up or down by anywhere from 1 to 10 points any time the Player Character makes a decision that directly or indirectly supports her future claim and preferred policies. The candidate with the most points at the end of the game is ultimately elected the next Divine in the epilogue, with a priority list reflecting her respective political clout used to break ties (from the most politically savvy to the least: Vivienne, Leliana, Cassandra). |
|
| Algorithmic Story Branching / int_1aacbbc9 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_1aacbbc9 | featureConfidence |
1.0 | |
| Dragon Age (Franchise) | hasFeature |
Algorithmic Story Branching / int_1aacbbc9 | |
| Algorithmic Story Branching / int_20663f23 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_20663f23 | comment |
The Cute Knight series: The two main ways to result in endings that depend on calculations instead of being triggered by some event, are if the Dream stat falls to 0 or below for a Bittersweet Ending, or the Player Character turns 21, for a happier one, usually. At those points, an ending is chosen based on the occupation / activity she's done the most, having her continue in that vein. But there are other types of conditions: Cute Knight: For Bittersweet Endings with variations, there's a Modular Epilogue sentence or paragraph about a stat that's low, relative to the requirement for a sweeter variation. Cute Knight Kingdom: If she loses all her Dream, but also has a lot of money, the Player Character will get a bittersweet Merchant ending, otherwise the Bittersweet Ending will depend on her favored occupation. |
|
| Algorithmic Story Branching / int_20663f23 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_20663f23 | featureConfidence |
1.0 | |
| Cute Knight (Video Game) | hasFeature |
Algorithmic Story Branching / int_20663f23 | |
| Algorithmic Story Branching / int_2192aeb3 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_2192aeb3 | comment |
Fire Emblem: In Fire Emblem: The Binding Blade, whether the fourth act of the story takes place in Ilia or Sacae depends on whether the combined total levels of the players' Pegasus Knights or Nomads is higher, respectively. Fire Emblem: The Blazing Blade has several branching chapters that follow a similar system, one is based on whether the Lords' combined levels are above or below 50, the other is the level gains of Hero's Crest-promoting classes vs Guiding Ring-promoting classes. Fire Emblem: Awakening: Most characters don't get married unless the player selects the unlocked S support conversation scene. However, at the end of the first half of the game, there is a cutscene in which Chrom proposes to the unmarried love interest he has the highest Support level with. Support pointsnote gained by fighting next to each other or casting spells on or Dancing for the other count regardless of whether the player has viewed the support conversations they unlock, as there's no chance to view Chrom's supports with Olivia before this point, but she's still a viable option. If he has no support points with any free option, he'll instead get married to a generic village maiden NPC. Fire Emblem: Three Houses: Unlike in some previous games of the series, only the Player Character Byleth can reach an S-rank support with an NPC, while recruitable NPCs are restricted to, at most, A-level supports with each other. However, after two recruits achieve an A-level support, the game secretly keeps counting how many times they've assisted each other in combat, and in the Modular Epilogue of the game, all surviving NPCs are paired off based on this hidden support score, with each receiving a special "paired ending" slide with the person they assisted or were assisted by the most. |
|
| Algorithmic Story Branching / int_2192aeb3 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_2192aeb3 | featureConfidence |
1.0 | |
| Fire Emblem (Franchise) | hasFeature |
Algorithmic Story Branching / int_2192aeb3 | |
| Algorithmic Story Branching / int_34ecce5f | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_34ecce5f | comment |
Epic Battle Fantasy 5: As explained in-depth here, the Modular Epilogue's scenes are initially determined by which of and whether the Relationship Values between each possible pair of human Player Characters has reached certain numbers, with target values determined by number of completed achievements in its Achievement System, among other factors. However, it will be the Golden Ending if the achievement for beating the Final Boss on the Harder Than Hard "Epic" difficulty has been acquired, in any game, or if the party is an invoked Solo-Character Run or two-person party Challenge Run. | |
| Algorithmic Story Branching / int_34ecce5f | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_34ecce5f | featureConfidence |
1.0 | |
| Epic Battle Fantasy 5 (Video Game) | hasFeature |
Algorithmic Story Branching / int_34ecce5f | |
| Algorithmic Story Branching / int_39fe00f1 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_39fe00f1 | comment |
Dragon Age: Inquisition: At the start of the game, the current Divine of the Chantry dies, and towards the end, three high-ranking members of the Inquisition announce their claims as her successors. As explained in-depth here, each candidate has a hidden score (independent of the regular Relationship Values) that starts out at 0 at the beginning of the game and goes up or down by anywhere from 1 to 10 points any time the Player Character makes a decision that directly or indirectly supports her future claim and preferred policies. The candidate with the most points at the end of the game is ultimately elected the next Divine in the epilogue, with a priority list reflecting her respective political clout used to break ties (from the most politically savvy to the least: Vivienne, Leliana, Cassandra). | |
| Algorithmic Story Branching / int_39fe00f1 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_39fe00f1 | featureConfidence |
1.0 | |
| DragonAgeInquisition | hasFeature |
Algorithmic Story Branching / int_39fe00f1 | |
| Algorithmic Story Branching / int_60fad6e | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_60fad6e | comment |
In Way of the Samurai 4, there are three factions the player can help throughout the first three days. The game keeps track of which missions the player completes, as well as if a player angers a certain faction through his choices. On the fourth day, the game will use these factors to calculate the side to which the player is most loyal, and have him represent the faction in a battle tournament before moving on for their side’s endgame. If the player doesn’t complete enough missions for any side, he’ll be given a neutral story that cuts itself off after the Tournament Arc. | |
| Algorithmic Story Branching / int_60fad6e | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_60fad6e | featureConfidence |
1.0 | |
| Way of the Samurai 4 (Video Game) | hasFeature |
Algorithmic Story Branching / int_60fad6e | |
| Algorithmic Story Branching / int_629cd094 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_629cd094 | comment |
Dragon Age: Origins: A minor example occurs late in the game, when the Warden and Arl Eamon's party calls for a Landsmeet to challenge Loghain's legitimacy as regent. Depending on which side quests you have completed, which allies you've won, and which arguments you bring to the final debate, points are added or subtracted to a hidden meter (with some allies, like Queen Anora and the Grand Cleric, mattering more than others). As long as it ultimately stands at 5+, the Landsmeet will move to depose Loghain; otherwise, the nobles will stand by him. As he refuses to give up power peacefully, either way, you will have to fight him, but deposing him legally allows you to do so in an honorable duel and even to subsequently recruit him into the Grey Wardens. | |
| Algorithmic Story Branching / int_629cd094 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_629cd094 | featureConfidence |
1.0 | |
| Dragon Age: Origins (Video Game) | hasFeature |
Algorithmic Story Branching / int_629cd094 | |
| Algorithmic Story Branching / int_640d9be1 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_640d9be1 | comment |
In Fire Emblem: The Binding Blade, whether the fourth act of the story takes place in Ilia or Sacae depends on whether the combined total levels of the players' Pegasus Knights or Nomads is higher, respectively. | |
| Algorithmic Story Branching / int_640d9be1 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_640d9be1 | featureConfidence |
1.0 | |
| Fire Emblem: The Binding Blade (Video Game) | hasFeature |
Algorithmic Story Branching / int_640d9be1 | |
| Algorithmic Story Branching / int_76686539 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_76686539 | comment |
Mass Effect: As explained here, the game maintains a hidden priority list ranking each Player Party member along the Paragon-Renegade axis, starting out with Kaidan > Liara > Tali > Garrus > Ashley > Wrex (from most Paragon to most Renegade), but slightly rearranging it based on the dialogue options the player picks when speaking with them on the Normandy. The current ranking has a minor story effect at every key plot decision, where, of the two squadmates accompanying Shepard, the one ranked more Paragon will advocate for a Paragon resolution, and the other, for Renegade one, Good Angel, Bad Angel-style. | |
| Algorithmic Story Branching / int_76686539 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_76686539 | featureConfidence |
1.0 | |
| Mass Effect (Video Game) | hasFeature |
Algorithmic Story Branching / int_76686539 | |
| Algorithmic Story Branching / int_7668653a | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_7668653a | comment |
Mass Effect 2: In the final leg of the Suicide Mission endgame, the surviving squad members who don't accompany Shepard to the Final Boss battle hunker down to stop enemy reinforcements from catching up with Shepard. This entire battle occurs off-screen, but can have highly variable outcomes in regards to which squadmates survive: as explained in-depth here, each squadmate has a hidden "Hold the Line (HTL) score", ranging from 0 to 3 (incremented by 1 if their respective Loyalty Mission has been succesfully completed), and the number of casualties (ranging from zero to everyone) depends both on the total number of the defenders and on their average HTL score. After the game calculates the number of casualties, it selects the specific squadmates to die based on a priority list that, while not explicitly numeric, implicitly ranks them by their ability to survivenote e.g. the Supporting Leader Garrus, despite his high HTL score, dies (likely by Taking the Bullet for a squishier member) before the lone wolf assassin Thane, whose HTL score is much lower. | |
| Algorithmic Story Branching / int_7668653a | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_7668653a | featureConfidence |
1.0 | |
| Mass Effect 2 (Video Game) | hasFeature |
Algorithmic Story Branching / int_7668653a | |
| Algorithmic Story Branching / int_7668653b | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_7668653b | comment |
Mass Effect 3: Half-way through the game, Shepard is thrust into a tense standoff against the Virmire Survivor, and how it is resolved depends on a number of player choices from across the trilogynote from having romanced them in Mass Effect, through saving Thane in part two, right up to taking the Paragon interrupt during the standoff itself. Each choice adds or subtracts 0 to 2 points to/from a hidden "trust level" (as explained in-depth here), and if the final trust level is below zero, Shepard's opponent cannot be talked down, forcing you to kill them; if it falls within the 0-3 range, you are allowed one final persuasion check to deescalate the situation; and at trust level 4 or higher, the opponent sides with Shepard automatically. | |
| Algorithmic Story Branching / int_7668653b | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_7668653b | featureConfidence |
1.0 | |
| Mass Effect 3 (Video Game) | hasFeature |
Algorithmic Story Branching / int_7668653b | |
| Algorithmic Story Branching / int_78e27fa7 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_78e27fa7 | comment |
Fire Emblem: The Blazing Blade has several branching chapters that follow a similar system, one is based on whether the Lords' combined levels are above or below 50, the other is the level gains of Hero's Crest-promoting classes vs Guiding Ring-promoting classes. | |
| Algorithmic Story Branching / int_78e27fa7 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_78e27fa7 | featureConfidence |
1.0 | |
| Fire Emblem: The Blazing Blade (Video Game) | hasFeature |
Algorithmic Story Branching / int_78e27fa7 | |
| Algorithmic Story Branching / int_7988cb68 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_7988cb68 | comment |
Mass Effect: Mass Effect: As explained here, the game maintains a hidden priority list ranking each Player Party member along the Paragon-Renegade axis, starting out with Kaidan > Liara > Tali > Garrus > Ashley > Wrex (from most Paragon to most Renegade), but slightly rearranging it based on the dialogue options the player picks when speaking with them on the Normandy. The current ranking has a minor story effect at every key plot decision, where, of the two squadmates accompanying Shepard, the one ranked more Paragon will advocate for a Paragon resolution, and the other, for Renegade one, Good Angel, Bad Angel-style. Mass Effect 2: In the final leg of the Suicide Mission endgame, the surviving squad members who don't accompany Shepard to the Final Boss battle hunker down to stop enemy reinforcements from catching up with Shepard. This entire battle occurs off-screen, but can have highly variable outcomes in regards to which squadmates survive: as explained in-depth here, each squadmate has a hidden "Hold the Line (HTL) score", ranging from 0 to 3 (incremented by 1 if their respective Loyalty Mission has been succesfully completed), and the number of casualties (ranging from zero to everyone) depends both on the total number of the defenders and on their average HTL score. After the game calculates the number of casualties, it selects the specific squadmates to die based on a priority list that, while not explicitly numeric, implicitly ranks them by their ability to survivenote e.g. the Supporting Leader Garrus, despite his high HTL score, dies (likely by Taking the Bullet for a squishier member) before the lone wolf assassin Thane, whose HTL score is much lower. Mass Effect 3: Half-way through the game, Shepard is thrust into a tense standoff against the Virmire Survivor, and how it is resolved depends on a number of player choices from across the trilogynote from having romanced them in Mass Effect, through saving Thane in part two, right up to taking the Paragon interrupt during the standoff itself. Each choice adds or subtracts 0 to 2 points to/from a hidden "trust level" (as explained in-depth here), and if the final trust level is below zero, Shepard's opponent cannot be talked down, forcing you to kill them; if it falls within the 0-3 range, you are allowed one final persuasion check to deescalate the situation; and at trust level 4 or higher, the opponent sides with Shepard automatically. |
|
| Algorithmic Story Branching / int_7988cb68 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_7988cb68 | featureConfidence |
1.0 | |
| Mass Effect (Franchise) | hasFeature |
Algorithmic Story Branching / int_7988cb68 | |
| Algorithmic Story Branching / int_8ffa8e6 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_8ffa8e6 | comment |
Science Girls!: The Relationship Values with each of the five girls at the end of the game determine which one of them becomes the Final Boss. | |
| Algorithmic Story Branching / int_8ffa8e6 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_8ffa8e6 | featureConfidence |
1.0 | |
| Science Girls! (Video Game) | hasFeature |
Algorithmic Story Branching / int_8ffa8e6 | |
| Algorithmic Story Branching / int_96631e09 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_96631e09 | comment |
Princess Maker: The Player Character has seven Stats and a Reputation score, and the combination thereof at the end of the game determines which of the 30 endings she gets. Specifically, if her Reputation is 1200 or more, she gets the Ruling Queen ending; and if it's between 800 and 1199, the Princess ending. Otherwise, the ending is based on which Stat is her highest and, again, on her Reputation: each Stat has four endings, from the worst (0 to 49 Rep) to the best (400 to 799 Rep). | |
| Algorithmic Story Branching / int_96631e09 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_96631e09 | featureConfidence |
1.0 | |
| Princess Maker (Video Game) | hasFeature |
Algorithmic Story Branching / int_96631e09 | |
| Algorithmic Story Branching / int_978ca9a8 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_978ca9a8 | comment |
Cute Knight Kingdom: If she loses all her Dream, but also has a lot of money, the Player Character will get a bittersweet Merchant ending, otherwise the Bittersweet Ending will depend on her favored occupation. | |
| Algorithmic Story Branching / int_978ca9a8 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_978ca9a8 | featureConfidence |
1.0 | |
| Cute Knight Kingdom (Video Game) | hasFeature |
Algorithmic Story Branching / int_978ca9a8 | |
| Algorithmic Story Branching / int_e04f934e | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_e04f934e | comment |
Fire Emblem: Three Houses: Unlike in some previous games of the series, only the Player Character Byleth can reach an S-rank support with an NPC, while recruitable NPCs are restricted to, at most, A-level supports with each other. However, after two recruits achieve an A-level support, the game secretly keeps counting how many times they've assisted each other in combat, and in the Modular Epilogue of the game, all surviving NPCs are paired off based on this hidden support score, with each receiving a special "paired ending" slide with the person they assisted or were assisted by the most. | |
| Algorithmic Story Branching / int_e04f934e | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_e04f934e | featureConfidence |
1.0 | |
| Fire Emblem: Three Houses (Video Game) | hasFeature |
Algorithmic Story Branching / int_e04f934e | |
| Algorithmic Story Branching / int_e9e265b6 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_e9e265b6 | comment |
Fire Emblem: Awakening: Most characters don't get married unless the player selects the unlocked S support conversation scene. However, at the end of the first half of the game, there is a cutscene in which Chrom proposes to the unmarried love interest he has the highest Support level with. Support pointsnote gained by fighting next to each other or casting spells on or Dancing for the other count regardless of whether the player has viewed the support conversations they unlock, as there's no chance to view Chrom's supports with Olivia before this point, but she's still a viable option. If he has no support points with any free option, he'll instead get married to a generic village maiden NPC. | |
| Algorithmic Story Branching / int_e9e265b6 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_e9e265b6 | featureConfidence |
1.0 | |
| Fire Emblem Awakening (Video Game) | hasFeature |
Algorithmic Story Branching / int_e9e265b6 | |
| Algorithmic Story Branching / int_ec61a56e | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_ec61a56e | comment |
Cute Knight: For Bittersweet Endings with variations, there's a Modular Epilogue sentence or paragraph about a stat that's low, relative to the requirement for a sweeter variation. | |
| Algorithmic Story Branching / int_ec61a56e | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_ec61a56e | featureConfidence |
1.0 | |
| Cute Knight (Video Game) | hasFeature |
Algorithmic Story Branching / int_ec61a56e | |
| Algorithmic Story Branching / int_ee384546 | type |
Algorithmic Story Branching | |
| Algorithmic Story Branching / int_ee384546 | comment |
Cyberpunk 2077: The long-term outcome of the "Sinnerman" sidequest arc depends on multiple dialogues between V and Joshua during said arc, with some choices adding one or two points to Joshua's hidden "doubt" meter. If this meter reaches or exceeds 4 by the end of the questline, the braindance of his voluntary crucifixion becomes a commercial flop; otherwise, his faith makes it a smash hit. | |
| Algorithmic Story Branching / int_ee384546 | featureApplicability |
1.0 | |
| Algorithmic Story Branching / int_ee384546 | featureConfidence |
1.0 | |
| Cyberpunk 2077 (Video Game) | hasFeature |
Algorithmic Story Branching / int_ee384546 |
The following is a list of statements referring to the current page from other pages.
Copyright of DBTropes.org wrapper 2009-2013 DFKI Knowledge Management. Imprint. - Thanks to Bakken&Baeck for hosting. Contact.
Copyright of data TVTropes.org contributors under Creative Commons Attribution-Share Alike 3.0 Unported License.
Copyright of data TVTropes.org contributors under Creative Commons Attribution-Share Alike 3.0 Unported License.