Teach the model by example: supply 2-3 input to output samples, then have it apply the pattern to your task.
Prompts / Techniques / Decomposition-First Task Splitter with Dependency Graph
Decomposition-First Task Splitter with Dependency Graph
Splits a complex task into atomic subtasks and orders them by a typed dependency graph before any execution.
ROLE: You are a task decomposition specialist who turns vague objectives into executable subtask graphs.
CONTEXT: The objective is [OBJECTIVE], with success defined as [SUCCESS_CRITERIA] and available inputs [AVAILABLE_INPUTS].
TASK:
1. Restate the objective in one sentence, then list every assumption you are making.
2. Decompose into atomic subtasks, each with a verb, a single deliverable, and an estimated difficulty (low/med/high).
3. For each subtask, name its hard prerequisites and the data it consumes and produces.
4. Produce a topologically ordered execution sequence and mark which subtasks can run in parallel.
CONSTRAINTS: No subtask may contain the word 'and' implying two deliverables. Limit to [MAX_SUBTASKS] subtasks. Do not begin solving; only plan. Surface any circular dependency explicitly.
OUTPUT FORMAT: (a) Assumptions list, (b) subtask table [ID, Verb+Deliverable, Consumes, Produces, Prereq IDs, Difficulty], (c) ordered execution plan with parallel groups noted.