$npx -y skills add human-avatar/skills-for-humanity --skill s4h-constraint-workaround-mappingFinds paths around a fixed constraint without removing it — routing around a hard limit to reach the same goal. Triggers: 'work around this', 'given this constraint', 'path around the blocker', 'how do we do this anyway', 'constrained solution'.
| 1 | # Constraint Workaround Mapping |
| 2 | |
| 3 | Some constraints are real and cannot be inverted or removed. The question then is not how |
| 4 | to eliminate the constraint, but how to route around it to the same destination. A workaround |
| 5 | is not a compromise — it is a valid path that respects a real limit while still delivering |
| 6 | the outcome. |
| 7 | |
| 8 | --- |
| 9 | |
| 10 | ## Your Process |
| 11 | |
| 12 | **Step 1: State the Constraint and Confirm It's Hard** |
| 13 | Write the constraint. Then confirm: is this actually fixed? A truly hard constraint has a |
| 14 | concrete source — law, technical impossibility, signed contract. If the source is unclear, |
| 15 | use constraint-hardness-testing first. |
| 16 | |
| 17 | **Framing check:** Confirm the specific constraint and the goal it is blocking before continuing. State what you've identified — the actual constraint and the outcome the user is trying to reach — in one sentence, then use `AskUserQuestion`: |
| 18 | - **Question:** "I'm reading this as: [your one-sentence framing of the constraint and the goal it is blocking]. Is that right?" |
| 19 | - **Header:** "Framing" |
| 20 | - **Options:** |
| 21 | - **Yes — proceed** — framing is correct |
| 22 | - **Adjust** — one element is off; user will correct it before you continue |
| 23 | - **Reframe** — different situation than read; incorporate the correction before proceeding |
| 24 | |
| 25 | **Step 2: Map the Exact Boundary** |
| 26 | What does this constraint specifically prevent? What does it explicitly not prevent? Most |
| 27 | constraints are narrower than they appear. Mapping the boundary precisely reveals the space |
| 28 | around it. |
| 29 | |
| 30 | **Step 3: List All Paths Blocked** |
| 31 | Enumerate every approach to the goal that the constraint forecloses. Be thorough — you are |
| 32 | building a map of what's off the table. |
| 33 | |
| 34 | **Step 4: Find Adjacent Paths** |
| 35 | For each blocked path: is there an adjacent path that reaches the same goal without crossing |
| 36 | the constraint? Adjacent means achieving the same underlying outcome through a different |
| 37 | mechanism — not a lesser outcome through the same mechanism. |
| 38 | |
| 39 | **Step 5: Generate 3-5 Workarounds with Cost** |
| 40 | **Before narrowing:** Show the complete set of adjacent paths identified in Step 4 to the user first. Use `AskUserQuestion`: |
| 41 | - **Question:** "I've identified [N] adjacent paths. Before I select the most feasible workarounds, are there any you'd flag as especially important, or any I've missed?" |
| 42 | - **Header:** "Prioritise" |
| 43 | - **Options:** |
| 44 | - **Proceed with your selection** — the set looks right |
| 45 | - **Flag one** — user will name a specific path to include |
| 46 | - **Add a missing one** — user will describe it |
| 47 | |
| 48 | For each viable adjacent path, state the cost relative to the direct approach: additional |
| 49 | time, complexity, dependency, quality reduction, or reversibility loss. |
| 50 | |
| 51 | **Step 6: Select Best Cost/Benefit** |
| 52 | Choose the workaround where the cost is lowest relative to the outcome achieved. If all |
| 53 | workarounds are too costly, the right answer may be to re-examine the goal. |
| 54 | |
| 55 | --- |
| 56 | |
| 57 | ## Human Check-in |
| 58 | |
| 59 | Before proceeding, use the `AskUserQuestion` tool. State your interpretation of the situation in 1–2 sentences — what is being analyzed and what the core question is — then ask: |
| 60 | |
| 61 | - **Question:** "My read: [your 1–2 sentence interpretation]. How do you want to proceed?" |
| 62 | - **Header:** "Scope" |
| 63 | - **Options:** |
| 64 | - **Full analysis** — Complete all steps, reasoning shown throughout |
| 65 | - **Key findings only** — Bottom-line output, skip step-by-step detail |
| 66 | - **Two best workarounds only** — Highest-feasibility paths around the constraint |
| 67 | - **Reframe** — The read is off; correct it and the analysis will follow the corrected framing |
| 68 | |
| 69 | Proceed based on their selection. If the user reframes, incorporate the correction before running any analysis. |
| 70 | |
| 71 | ## Output Format |
| 72 | |
| 73 | **Constraint:** |
| 74 | > [Statement + source confirming it's hard] |
| 75 | |
| 76 | **Constraint boundary:** |
| 77 | - Blocks: [what it prevents] |
| 78 | - Does not block: [what remains available] |
| 79 | |
| 80 | **Blocked paths:** |
| 81 | > [Bulleted list] |
| 82 | |
| 83 | **Workarounds:** |
| 84 | |
| 85 | | # | Path | How it reaches the goal | Cost vs direct path | |
| 86 | |---|------|------------------------|---------------------| |
| 87 | | 1 | | | | |
| 88 | | 2 | | | | |
| 89 | | 3 | | | | |
| 90 | |
| 91 | **Recommended path:** |
| 92 | > [Workaround name] — [rationale for cost/benefit selection] |
| 93 | |
| 94 | --- |
| 95 | |
| 96 | ## Notes |
| 97 | |
| 98 | The map is only useful if the constraint boundary in Step 2 is drawn accurately. People |
| 99 | regularly assume constraints block more than they do — which is why checking what a |
| 100 | constraint does NOT prevent is as important as what it does. |
| 101 | |
| 102 | --- |
| 103 | |
| 104 | ## What's Next |
| 105 | |
| 106 | After delivering this output, use `AskUserQuestion` to offer the next move: |
| 107 | |
| 108 | - **Question:** "Workarounds mapped. What's next?" |
| 109 | - **Header:** "Next" |
| 110 | - **Options:** |
| 111 | - `/s4h-decision-option-mapping` — Map decision options using the available workarounds |
| 112 | - `/s4h-logic-check` — Validate the logic of the proposed workarounds |
| 113 | - `/s4h-d |