PLECK lesson 46 · suggested week 10, day 1
Map a small branching story
Objective. Design a choice graph with reachable endings.
Godot Engine Standard desktop editor 4.7.2-stable, GDScript (Godot 4), Compatibility renderer. Headless Godot 4.7.2.stable.official.ed1daf0bf passed 106 assertions on the supplied scaffolds, including malformed JSON saves. Audio used the Dummy driver and a synthetic WAV, not a speaker. The visual editor, browser export, and signed-in submission were not tested. The desk still does not run a student's own upload.
About 55 minutes. The due date is chosen by a parent.
Branch diagrams, dialogue data, containers and keyboard focus
Suggested pace: Recall and predict 5 min; Read instruction and scaffold 12 min; Build or design the assigned artifact 25 min; Run acceptance tests 8 min; Explain and checkpoint 5 min.
Materials: Paper and pencil or a private text document, Local course folder and prior checkpoint, No paid assets or public account required.
Comes after VGC-L045.
Archive Lantern is a fictional exploration puzzle told through buttons and short passages. A story graph has nodes for passages and arrows for choices. Start with an entrance, a keeper, a sign, a locked room and two endings. Every passage needs a way forward or a deliberate ending; accidental dead ends trap the player. Choices should describe actions rather than hide arbitrary right answers. Use fictional characters and places. Nothing in the story should ask the player for their real identity or contact information.
Worked example
A passage with key entrance can display any original sentence. Its choice ["Read the note", "note"] links to a stable note key even if the sentence is later edited.
Map a small branching story — evidence task
- 1. Draw a six-node graph including two endings and one rejoining branch.
- 2. Label each arrow with the exact button text.
Deliverable. Story graph photo/scan or private diagram document.
Acceptance checks
- VGC-L046-T1. Every node is reachable from the entrance.
- VGC-L046-T2. Every nonending node has at least one outgoing choice.
Understanding question. What is the difference between a deliberate ending and a broken dead end?
Submit readable text or photos/scans of each numbered design page. Audio explanation may supplement a diagram or text, not replace requested artifacts.
If this is still shaky. Use three screens and two buttons with C-DIALOGUE. Draw every link before writing dialogue. Start with the first assigned task and re-run its acceptance test before adding the remaining feature.
Optional extra. Create a branch that rejoins the main path while preserving a meaningful choice. Document one changed parameter, your prediction, and the observed effect; optional, not required for completion.
Turn in a typed answer, a JPEG, PNG, or WebP photo, a PDF scan, or an MP3, WAV, M4A, MP4, or WebM file up to 4 MB. A parent can log paper. One https address is stored as text and is not opened or run. Zip and code files are refused.
- Godot step by step: nodes, scenes, GDScript, input, signals
Free public documentation, no account. Same class help is available within the desktop editor.
· Opening this link does not submit the lesson.
This is a preview. A parent assigns the lesson and chooses the due date after the student is enrolled. The answer key is not on this page.
