Fewer visible options can split one choice into layers without lowering total time
Aliases: progressive disclosure · information architecture · Hick's law misuse
What it is
Splitting a large menu into layers with fewer visible options does not automatically lower total decision time. It turns one choice into a sequence of hierarchical choices: each layer requires reading categories, deciding, waiting for expansion, and retaining context. Hick's law alone cannot establish that showing fewer items is faster.
Why it happens
When grouping matches a mental model, an initial category sharply reduces subsequent candidates and the extra step is worthwhile. When categories are ambiguous, people guess, backtrack, and retry, adding search and memory cost. Total cost depends on uncertainty across layers, switching cost, and recovery, not first-level count.
Studying it
Compare flat and hierarchical variants on end-to-end time, first correct path, backtracking, category errors, and search use. Include frequent, rare, and cross-category work with novices and experienced users. Tree testing can measure whether category names predict the intended path before UI implementation.
Where it stops holding
Hierarchy can improve browseability for many items with strong classification and stepwise work; flat lists can be better for comparison, overlapping categories, or shifting targets. Search, recents, and shortcuts change the relation, so do not reduce evaluation to depth or item count.
Applying it
- Add hierarchy only where category labels are predictive and each step clearly reduces candidates; otherwise retain search or direct access.
- Preserve selected context and a clear return path after drill-down to reduce recovery from a wrong layer.
- Accept a structure on complete-task time, backtracking, and discovery of rare work, not first-screen count alone.
Related
- Same group: B1.13.1 With unequal alternatives, decision time depends on information distribution, not count · B1.13.2 When visual search dominates, time rises linearly with option count · B1.13.3 The law covers choice among known options, not time to understand them · B1.13.5 Semantic similarity makes the law underestimate real decision time
- Nearby: B1.04 Hick-Hyman law · B1.07 Power law of practice
- Search terms:
choice hierarchy·progressive disclosure·information architecture
Cards in the same group
- B1.13.1With unequal alternatives, decision time depends on information distribution, not count
- B1.13.2When visual search dominates, time rises linearly with option count
- B1.13.3The law covers choice among known options, not time to understand them
- B1.13.5Semantic similarity makes the law underestimate real decision time