Description
Plot a think-aloud protocol as a graph of knowledge states and operator applications to show search, backtracking and repetition during problem solving.
The problem-behaviour graph represents a verbal protocol as search through a problem space. Each node is a state of knowledge; each horizontal segment is the application of an operator that moves to a new state. When the person returns to an earlier state, a vertical line drops down and a new horizontal line starts from that state; reapplying an operator already used is marked with a double line. Read from top left, the graph shows depth of search, backtracking and repetition at a glance, and stretches can be annotated with the subgoal being pursued. Newell and Simon's classic example of one subject solving DONALD + GERALD = ROBERT has 238 nodes over about 30 minutes, about 7 seconds per state. The graph also served as the target for moment-by-moment cognitive simulations.
Attributes
- Discipline
- Task Analysis & Cognitive Modelling
- Loss type
- Extinct
- Stage
- Evaluation, Design
- Data
- Qualitative
- Effort
- Weeks
Steps
- Record and transcribe a person thinking aloud while solving a well-defined problem or task.
- Segment the protocol into successive states of knowledge and identify the operator applied at each step.
- Draw the initial state at top left and each operator application as a horizontal segment to a new state.
- When the person returns to an earlier state, drop a vertical line and continue from that state on a new line.
- Mark reapplied operators with double lines and annotate stretches with the current subgoal.
- Count nodes, backtracks and repetitions and compute mean time per state to compare participants or designs.
Sources
- Unified Theories of Cognition (Newell, 1990)
- Human Problem Solving (Newell & Simon, 1972)
Also known as
- PBG
- Problem behavior graph
- Search plot of a verbal protocol
Categories
- User Research
- Task Analysis & Cognitive Modelling