What does Visual Saliency and Interface Cognition conclude, in numbers, about “Deciding and Pointing: the Hick–Hyman Law and Fitts's Law”?

Answer: The \(+1\) in Hick's 1952 \(\log(n+1)\) stands for the "no signal" alternative; Hyman's 1953 entropy \(H = \sum p_i\log_2(1/p_i)\) has no \(+1\). The framework's \(\sum p_i\log_2(1/p_i + 1)\) equals \(\log_2(n+1)\) with equal probabilities and is neither law otherwise; Hyman's entropy should be used instead. The Hick–Hyman law describes deciding when the target is known, not searching among unfamiliar labels, and its slope changes with practice and compatibility. Fitts's original form is negative for \(D/W < 1/2\); interfaces need the Shannon form. "Minimising" the sum of search, decision and pointing makes sense only once the variables, the probability distribution and the type of user are stated: with the logarithmic form the optimal widths are proportional to click probabilities and the expected difficulty equals a constant plus Hyman's entropy; total time for novices is roughly linear and for experts roughly logarithmic, and the two call for different designs.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's models and hypotheses; all pages, brands and data in the book are fictional or simulated.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only

A. bitsHick log2(n+1)Hyman Hframeworkframe - H
uniform n = 21.5851.0001.5850.585
uniform n = 42.3222.0002.3220.322
uniform n = 83.1703.0003.1700.170
8 items, Zipf s = 13.1702.6202.8830.263
8 items, Zipf s = 23.1701.6852.2080.523
8 items, one at 0.933.1700.5621.4460.883
2 items, 0.99 / 0.011.5850.0811.0640.983
1 item1.0000.0001.0001.000
B. fits to data generated by Hyman's law (1,600 trials, 8 menus)
Hyman H a = 200.0 ms b = 149.7 ms/bit R^2 = 0.985
framework a = -3.5 ms b = 208.4 ms/bit R^2 = 0.979
Hick log2(n+1) a = 84.8 ms b = 133.6 ms/bit R^2 = 0.491

Key formula

\[RT = a + bH,\qquad H = \sum_{i=1}^{n} p_i\log_2\frac{1}{p_i}.\]
Show the full program
# Three ways of writing the "decision entropy" in the Hick-Hyman law RT = a + b H.
#   Hick (1952):   H = log2(n + 1)           (+1: the extra "no signal" alternative)
#   Hyman (1953):  H = sum p_i log2(1/p_i)   (Shannon entropy, no +1)
#   framework:     H = sum p_i log2(1/p_i + 1)
# A: the three on uniform and skewed menus. B: synthetic choice-RT data generated by
# Hyman's law (a = 200 ms, b = 150 ms/bit, noise sd 20 ms; illustrative values), fitted
# by least squares with each measure as predictor.
import math, random, statistics

def hick(p):  return math.log2(len(p) + 1)
def hyman(p): return sum(q * math.log2(1 / q) for q in p if q > 0)
def frame(p): return sum(q * math.log2(1 / q + 1) for q in p if q > 0)

def zipf(n, s=1.0):
    w = [1 / (k + 1) ** s for k in range(n)]; t = sum(w)
    return [x / t for x in w]

MENUS = [("uniform n = 2", [.5, .5]), ("uniform n = 4", [.25] * 4),
         ("uniform n = 8", [.125] * 8), ("8 items, Zipf s = 1", zipf(8)),
         ("8 items, Zipf s = 2", zipf(8, 2)), ("8 items, one at 0.93", [.93] + [.01] * 7),
         ("2 items, 0.99 / 0.01", [.99, .01]), ("1 item", [1.0])]

def fit(x, y):
    mx, my = statistics.fmean(x), statistics.fmean(y)
    b = sum((u - mx) * (v - my) for u, v in zip(x, y)) / sum((u - mx) ** 2 for u in x)
    a = my - b * mx; ss = sum((v - a - b * u) ** 2 for u, v in zip(x, y))
    return a, b, 1 - ss / sum((v - my) ** 2 for v in y)

if __name__ == "__main__":
    print("A. bits                       Hick log2(n+1)  Hyman H  framework  frame - H")
    for name, p in MENUS:
        print(f"   {name:24s} {hick(p):14.3f} {hyman(p):8.3f} {frame(p):10.3f}"
              f" {frame(p) - hyman(p):10.3f}")
    rng = random.Random(1953); x = {"hick": [], "hyman": [], "frame": []}; y = []
    for name, p in MENUS:
        for _ in range(200):
            y.append(200 + 150 * hyman(p) + rng.gauss(0, 20))
            for k, f in (("hick", hick), ("hyman", hyman), ("frame", frame)):
                x[k].append(f(p))
    print("B. fits to data generated by Hyman's law (1,600 trials, 8 menus)")
    for k, lab in (("hyman", "Hyman H"), ("frame", "framework"),
                   ("hick", "Hick log2(n+1)")):
        a, b, r2 = fit(x[k], y)
        print(f"   {lab:15s} a = {a:6.1f} ms  b = {b:6.1f} ms/bit  R^2 = {r2:.3f}")

Single source and citation

Fan, Y. (2026). Computational Aesthetics, Visual Saliency Maps and Cognitive Ergonomics in User Interface Design (Version 1.0.0), Chapter 2: Deciding and Pointing: the Hick–Hyman Law and Fitts's Law. 5D Library. https://doi.org/10.5281/zenodo.23836258

DOI: 10.5281/zenodo.23836258 · Read the monograph · 5DL-B-046 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026046,
  author    = {Fan, Yafu},
  title     = {Computational Aesthetics, Visual Saliency Maps and Cognitive Ergonomics in User Interface Design},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23836258},
  url       = {https://doi.org/10.5281/zenodo.23836258}
}

Other chapter answers in this book