Explains transition architectures and work packages
States with measurable exit criteria in date order; packages realising decisions and placements, each owned (TOGAF E-F).
Can AI do this?
AI does this well Most of the tested AI models master this. 3 of 4 models in the current benchmark master it.
| Model | Tier | Probability of mastery | Status |
|---|---|---|---|
| gemini-4-argon | Flagship | 100% | Mastered |
| gemini-3.5-flash-lite | Low cost | 100% | Not shown |
| gpt-6-luna | Low cost | 100% | Mastered |
| claude-haiku-5-5 | Low cost | 100% | Mastered |
Mastered means a probability of at least 90% that the model has this knobit, estimated from its graded answers. “Not shown” means the answers do not settle it either way. How the models are tested.
What it looks like in practice
Expected result: States with measurable exit criteria in date order; packages realising decisions and placements, each owned (TOGAF E-F).
How it is assessed: Answers a written question on the transition architecture correctly
Related knobits
Needed for
- A-502 Recognises a transition state with no exit criteria
- A-503 Recognises a work package realising nothing
- A-504 Recognises a target element no package reaches
- A-507 Recognises a work package with no owner
- A-508 Recognises transition states out of order
- A-509 Recognises a package realising a superseded decision
- A-510 Recognises an unmeasurable exit criterion
- A-552 Explains roadmap dependency and decommissioning order
All 14 knobits of Sequence the implementation roadmap.
Source: Practice the stage 5 reference and review checklist rest on