Library / Computational Thinking DPF
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 08:25:59 UTC · snapshot created 2026-10-03 08:26:43 UTC · last check 2026-10-03 08:26:30 UTC

CMP.4:8 - Common Anti-Patterns and How to Avoid Them

Misstep exposed by the methodConsequence and repair
Exclude a branch because one completion failedAnother completion may work. Derive a conflict applying to the entire represented set or continue branching.
Use a predicted score as a boundA better answer may be discarded. Keep the prediction as an ordering heuristic unless its bound property is established.
Prune ties while enumerating all optimaDistinct attaining answers disappear, as in the added-D case. Retain equality branches or use a separate complete enumeration.
Report interruption as impossibilityUnvisited alternatives remain. Return the candidate, remaining bounds and the limit on the conclusion.
Reuse a conflict after its domain changesA newly feasible answer can be excluded. Reconsider the consequence with its original conditions.