Structure & Craft
A 400-section budget: how many choices can a gamebook afford?
Fighting Fantasy-style books are built from about 400 numbered sections. A calculation shows why a pure branching tree runs out of pages after a handful of choices, and how bottlenecks fix it.
A gamebook is a book of numbered sections, and the reader jumps between them. That fixed budget of sections is the central design constraint. This article asks a simple question: with 400 sections to spend, how many choices can a reader make on one playthrough, and how much of the book will they see?
The budget
Wikipedia’s article on the Fighting Fantasy series says the main text of each gamebook is divided into a series of numbered sections, usually 400 though a few are shorter or longer. We use 400 as a round budget. The three designs below are simplified models, not descriptions of any particular book.
Three designs
A pure tree gives every choice its own new sections that never rejoin. With two options at each point, the number of sections down to depth d is 2^(d+1) - 1. That is 255 sections at depth 7 and 511 at depth 8, which is over budget. So a pure binary tree of 400 sections allows at most 7 choices along a path, ending in one of 2^7 = 128 endings.
A wider tree with three options per point uses (3^(d+1) - 1) / 2 sections to depth d: 121 at depth 4 and 364 at depth 5. With 400 sections the reader can make 5 choices and reach one of 3^5 = 243 endings.
A bottleneck design lets paths split and then rejoin at a shared hub. Suppose each stage uses three sections: one hub that offers two options, and one section for each option, both leading to the next hub. Then 400 sections allow 133 stages (3 x 133 = 399), and the reader makes 133 choices on one playthrough. The number of distinct routes is 2^133, about 1.1 x 10^40, but they differ only in which of two sections is visited at each stage.
| Design | Sections used | Choices on one path | Sections the reader visits | Share of the book seen |
|---|---|---|---|---|
| Binary tree, depth 7 | 255 | 7 | 8 | 3.1% (8 / 255) |
| Ternary tree, depth 5 | 364 | 5 | 6 | 1.6% (6 / 364) |
| Bottleneck, 133 stages | 399 | 133 | 266 | 66.7% (266 / 399) |
The sections visited are the path length: root plus one section per choice for the trees, and in the bottleneck model one hub and one option section per stage (133 + 133 = 266). The shares are the sections visited divided by the sections used.
What this means for writers and readers
- A tree makes each choice matter, but it spends nearly all the budget on text most readers will never see, and it caps the number of choices at a handful.
- A bottleneck makes a long story possible, but choices inside a stage can feel cosmetic unless they leave a trace, such as an item, a flag the book asks you to note, or a changed response later. Many books ask readers to record items or points on a sheet, which is one way to make earlier choices leave a trace (our reading).
- Real books mix both designs and add other devices; the series article also describes character statistics and dice, which this model leaves out.
Reading a gamebook with this in mind
When you open one, look at how often the text sends you to a section that many earlier sections also link to. Those shared sections are the hubs. Between them, look for what the book remembers about what you did. That gap between hubs is where the author spends craft.
Sources
- Wikipedia, Fighting Fantasy — accessed 2026-11-02
This article is written for: A reader or aspiring writer wants to understand why gamebooks and branching stories use merging paths, using numbers from a fixed page budget.
AI assistance recorded as: AI draft, not edited. Review status: approved.