Skip to main content

Heuristic Selection Lab

Attempt these four tasks before opening feedback. Keep a short contract, plan, argument or trace, and a looking-back note. These are the required P tasks; additional lesson drills are targeted repair or optional enrichment.

In states 0..8 with moves +2 and doubling within range, list all states that can reach 6. Include length-zero paths.

P06: Test an analogy​

Count assignments of n distinct items to two nonempty labelled groups, then to unlabelled groups. Explain the n=0 boundary.

P07: Disprove extrapolation​

Give two different formulas agreeing with f(n)=n*n for n=1,2,3 but disagreeing at n=4. Explain why three observations do not identify a rule.

P08: Choose informative cases​

Design five lower-bound tests covering empty input, duplicate keys, absent interior target, below-minimum and above-maximum targets. Give exact expected outputs.

Record assistance and reuse relevant lab evidence; do not duplicate the same work to satisfy several checklists.