Hick–Hyman Law (Equal Choices)
Models choice reaction time for n equally likely alternatives (n ≥ 1). This information-theoretic form assumes comparable, practised stimulus–response choices; it is not a universal law of menu browsing.
Formula
Live Calculator
MembersVariables
Example
With illustrative a = 0.20 s and b = 0.15 s/bit: 4 equally likely choices give 0.20 + 0.15 × 2 = 0.50 s; 8 give 0.20 + 0.15 × 3 = 0.65 s.
How it works
Choosing a response requires resolving uncertainty. In this version of the Hick–Hyman law, reaction time grows with the information in the choice: H = log₂(n) for equally likely alternatives. Doubling the alternatives adds one bit, rather than doubling predicted reaction time. For unequal probabilities, replace log₂(n) with entropy, −Σ pᵢ log₂(pᵢ), taking zero-probability terms as zero.
When to use it
Study practised choice-reaction tasks with comparable stimulus–response mappings. Interface design can draw inspiration from the model, but visual search, familiarity and reading make real menu use more complicated.
Worked example, step by step
Step 1: Use illustrative fitted constants a = 0.20 s and b = 0.15 s per bit.
Step 2: Four equally likely responses carry H = log₂(4) = 2 bits.
Step 3: RT = 0.20 + 0.15 × 2 = 0.50 seconds.
Step 4: Eight equally likely responses carry H = log₂(8) = 3 bits.
Step 5: RT = 0.20 + 0.15 × 3 = 0.65 seconds.
Interpretation: doubling the options adds 0.15 seconds in this fitted model. It does not double reaction time.
Common mistakes to avoid
- Using log₂(n) when alternatives are not equally likely.
- Confusing this entropy formulation with the log₂(n + 1) variant; coefficients depend on the chosen model.
- Applying the prediction to complex browsing or reading without validating it.
- Using natural logarithms with coefficients fitted for base-two logarithms.
Did You Know?
For unequal choice probabilities, the information term is entropy, H = −Σ pᵢ log₂ pᵢ, rather than simply log₂ n.
Share this formula
More in Computer Science
View allGustafson’s Law
IntermediateIdeal scaled-workload speedup when more processors allow a larger parallel task in the same elapsed time. Here s is the serial fraction of the parallel execution time, not the single-processor fraction used in Amdahl’s law.
Fitts’s Law (Shannon Form)
IntermediateAn empirical model of aimed movement time: farther or narrower targets generally take longer to reach. Use D ≥ 0, W > 0 and fitted coefficients for the device and task.
Shannon Entropy
AdvancedAverage information content of a random source (bits).
Master Theorem (form)
AdvancedAnalyzes running time of divide-and-conquer algorithms.
Hamming Distance
AdvancedNumber of positions at which two strings differ.
Bits to Represent n
BasicMinimum number of bits to represent n distinct values.