Optional25-minute shape:0–3 invite/purpose;3–7 one model/encounter;7–18 own chosen action;18–22 inspect/reason;22–25 possible next move. Split/pause freely; no finishing/timing score. Use one of the three specific routes, the corresponding pair of worked contexts, and usual local access support. Original models are unperformed teacher sources. Actual device authorship/operator is attributed; paper/director routes retain reasoning with implementation open. E/F fresh first capture before feedback/key.
Day 21 · Give the total a job
Invite: What should one total tell a pretend user?
Encounter/model: Moon-sticker tray: SET1, ADD2, SHOW gives3. ADD2 again gives5; SET2 instead replaces the total with2. This is an unperformed model, not real stock data.
Own practical action: Choose an invented collection/puzzle purpose and one check, such as “the start is included once”. Create your own SET and SHOW, run, then choose an ADD/change and predict. No complete model is entered for the child.
Observe/check: Ask what the start and total mean; inspect the actual chosen block and run if available.
Possible misconception: Thinking SET and ADD both mean putting another amount in. Compare before/after rather than demand a definition.
Next teaching move: Return to one SET/ADD contrast with their own values.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 1 is an independent free offer, not required catch-up.
Day 22 · Choose between two designs
Invite: Which instruction keeps earlier contributions?
Encounter/model: Pretend snowflake badge: start0, add4 then2 gives6. Setting4 then2 gives2. Two designs may both be valid for different stories.
Own practical action: Generate two tiny designs for a chosen purpose; compare or dictate block order, select against a criterion, create/change the preferred programme and run. One meaningful alternative is enough before continuation.
Observe/check: Does the explanation tie the instruction difference to the user’s purpose and actual variable state?
Possible misconception: Saying “the longer programme is better” without checking the intended job.
Next teaching move: Offer a changed start/input that separates their two designs.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 2 is an independent free offer, not required catch-up.
Day 23 · Let each record contribute
Invite: How will the same instructions process a new batch?
Encounter/model: Pretend telescope tokens: SET0; FOR EACH[ADD input]; SHOW on[1,2] gives3, and[1,5] gives6. The input source must be inside the loop.
Own practical action: Enter own fictional ordered records, make FOR EACH and choose ADD current input; predict, run and inspect each input’s contribution. Change one record and compare a new trace.
Observe/check: Point to one input and the total immediately before/after its ADD; who created and entered the block?
Possible misconception: Using a constant ADD while expecting it to read each record.
Next teaching move: Contrast ADD1 with ADD input for unequal records.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 3 is an independent free offer, not required catch-up.
Day 24 · Keep the start once
Invite: Where should initialisation happen?
Encounter/model: Pretend lantern marks: SET2 outside a loop plus[1,3] gives6; SET2 inside before ADD input gives5. Empty batch with outside SET/SHOW leaves2; inside-only SET/SHOW leaves total unset and cannot complete.
Own practical action: Place an own SET once or in a body intentionally; explain which matches the story, run zero/one/several records as useful and change its position. Use remove/add or move within a body; there is no automatic cross-body move.
Observe/check: Does learner distinguish persistent total from reset on each record? Capture a useful state explanation or repair.
Possible misconception: Assuming the loop automatically keeps a running sum regardless of SET position.
Next teaching move: Trace one short unequal batch, retaining every before/after value.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 4 is an independent free offer, not required catch-up.
Day 25 · Fresh E · a total repair
Invite: What first evidence is available before help?
Encounter/model: Only unrelated recall if needed: SET0, ADD5, SHOW means5. Do not model the held source or repair.
Own practical action: Offer Fresh E. Capture own first prediction/design/change/reason; approved-device actual entry/run is recorded separately. One meaningful first component may precede another sitting.
Observe/check: Use separate descriptive key after first capture. No new hints/key during capture.
Possible misconception: A matching final number alone does not prove a general input-responsive repair.
Next teaching move: Give specific feedback after first capture, then a different changed batch if teaching is needed.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 5 is an independent free offer, not required catch-up.
Day 26 · More than two useful outcomes
Invite: How can a record choose among three alternatives?
Encounter/model: Pretend kite badges: input<2 add0; otherwise input<5 add3; otherwise add5. From0 on[1,3,8] the totals are0,3,8. Threshold2 belongs to the middle and5 to the last.
Own practical action: Choose an own invented three-outcome rule; create IF inside FOR EACH with a nested IF in one body. Fill both bodies, predict one useful input per outcome, run/inspect and change a threshold.
Observe/check: Does the second decision happen only after the first fails? Does changed input alter actual branch/action?
Possible misconception: Treating nested alternatives as two independent IF tests and applying both awards.
Next teaching move: Draw or state one decision path, then compare its actual branch trace.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 6 is an independent free offer, not required catch-up.
Day 27 · A boundary can find a bug
Invite: Which input separates two rules?
Encounter/model: Pretend prism tokens use input<4 ADD1 otherwise ADD3. Input4 chooses3; changing to≤4 chooses1. This comparison boundary matters even if most inputs agree.
Own practical action: Choose a meaningful comparison/update change; predict a separating record. Run both sides and the exact boundary, then repair whichever version misses the criterion. Inspect SET placement too if state differs.
Observe/check: Is the test selected to reveal a difference, rather than just rerunning a familiar output?
Possible misconception: Using only one convenient record and declaring every branch correct.
Next teaching move: Offer the closest exact boundary and an alternative outcome, with no speed requirement.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 7 is an independent free offer, not required catch-up.
Day 28 · Explain an algorithm someone can follow
Invite: What must your representation preserve?
Encounter/model: Pretend comet tally: SET0, FOR EACH ADD2, SHOW on three invented inputs gives6 regardless of their values. A sketch that says ADD input changes the algorithm even if one batch happens to total6.
Own practical action: Communicate own ordered design as blocks, a nested diagram or exact spoken sequence. Compare an alternative against the same story; make one actual block change if chosen. Tell a willing reader what data a trace adds, if available.
Observe/check: Are initialisation, enclosing bodies, input source and alternative actions preserved? A verbal design remains design, not independent entry.
Possible misconception: Equating algorithms merely because one final total matches.
Next teaching move: Use a changed unequal batch that distinguishes constant from input.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 8 is an independent free offer, not required catch-up.
Day 29 · Choose a useful revision
Invite: How well does the actual solution meet the story?
Encounter/model: Pretend puzzle counter criteria: include start once, process every fictional record, give visible feedback. A correct total with no SHOW fails the visible-feedback criterion. No real user testing is supplied.
Own practical action: Evaluate own actual available solution, including one access/resource trade-off or possible effect on a pretend community; choose a meaningful edit and rerun. Optional willing private reader response is kept separate from prediction.
Observe/check: Which evidence supports the judgement and which possible effect is still a proposal?
Possible misconception: Inventing reader feedback or assuming one helper establishes multiple-tool competence.
Next teaching move: Select one criterion they can actually test; leave broader impact open.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 9 is an independent free offer, not required catch-up.
Day 30 · Fresh F · build your own rule
Invite: What does a new input change in your own design?
Encounter/model: No model of fresh F. Recall only blank tool access/support as needed.
Own practical action: Offer Fresh F, capture untouched first design/component before feedback, then allow actual programme entry/run/changed-input inspection across sittings. Alternatives valid.
Observe/check: Use separate key for variable state, iteration and multiple outcomes; identify actual operator/help and first versus later work.
Possible misconception: Awarding programme implementation for a paper design or supplied ready-made programme.
Next teaching move: Choose the next teaching move from the available evidence, not whole-band grade.
Use: choose one route, one model or neither where unnecessary. No30-route log or all-context quota. Home/extra 10 is an independent free offer, not required catch-up.