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 11:52:20 UTC · snapshot created 2026-10-03 11:53:41 UTC · last check 2026-10-03 13:00:08 UTC

CMP.4:3 - Forces

ForceWhat must be reconciled
Coverage and early progressBroad exploration retains alternatives; informed order may obtain a useful witness sooner.
Cheap and strong exclusionsA weak inexpensive bound can save more total work than a costly tight bound.
One answer and all answersA rule preserving one optimum can discard other attaining objects.
Current candidate and remaining possibilityA feasible result establishes what can be done; a branch bound constrains what remains possible.
Reuse and assumptionsA learned conflict can remain useful across branches but fail after constraints change.
Return time and strength of conclusionAn interrupted search can still supply a candidate and a bound, while exhaustion supports a stronger conclusion.