菜单
Compute Fibonacci numbers using recursive agent delegation where each agent spawns children for sub-problems. Use when you want to run a fibonacci test, recursive fibonacci test, or fibonacci test.
用 Codex 或 Claude 帮你安装 复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。
基于 SOC 职业分类
Run, write, and manage Birdhouse agentic tests. Each test exercises Birdhouse end-to-end using a real browser and a real sandbox or explicitly requested isolated OpenCode instance. Use when asked to run agentic tests, run a specific test, or add a new agentic test.
Add isolated Birdhouse web testing to an existing worktree-based agent workflow. Teaches agents to delegate browser validation to child agents, capture screenshots and MP4s, and clean up isolated runs when Cody asks.
Re-apply the Birdhouse opencode fork commits onto a new upstream tag one commit at a time. Load this skill when rebasing Birdhouse's custom opencode patches onto a fresh upstream release.
Birdhouse frontend architecture patterns for SolidJS and Corvu. Load when working on modals, dialogs, popovers, typeaheads, reactive component trees, buttons and navigation, or any component layering in birdhouse-workspace. Cross-references the generic `solidjs-best-practices` and `corvu-best-practices` skills.
Search message content across Birdhouse agents to find agents by what they did or said. Use when asked to find an agent, search agents, look up what an agent did, or locate a past conversation.
Complete guide to Birdhouse database migrations for agents. Covers both data.db and agents.db — generating migrations, verifying via tests, and applying to specific databases when explicitly asked. Load this skill whenever working on database migrations.
| name | fibonacci-recursive-agents |
| description | Compute Fibonacci numbers using recursive agent delegation where each agent spawns children for sub-problems. Use when you want to run a fibonacci test, recursive fibonacci test, or fibonacci test. |
| tags | ["birdhouse","test-case"] |
| trigger_phrases | ["fibonacci test","fibonacci recursive","fib test","recursive fibonacci","run fib","fibonacci agentic test"] |
| version | 1.0.0 |
| author | Birdhouse Team |
| metadata | {"internal":true} |
Compute fib(n) using recursive agents. Default n=3.
The root agent computes the result. YOU render the tree.
You are computing fib(N) recursively.
STEP 1 - Check your N:
- If N is 0: your answer is 0. Report it and stop. DO NOT create any child agents.
- If N is 1: your answer is 1. Report it and stop. DO NOT create any child agents.
- If N >= 2: you MUST spawn two child agents (one for fib(N-1) and one for fib(N-2)). You are NOT allowed to compute these yourself. You MUST use child agents.
STEP 2 (only if N >= 2) - Spawn both child agents using this exact prompt template (replace X with the actual number):
---
You are computing fib(X) recursively.
STEP 1 - Check your X:
- If X is 0: your answer is 0. Report it and stop. DO NOT create any child agents.
- If X is 1: your answer is 1. Report it and stop. DO NOT create any child agents.
- If X >= 2: you MUST spawn two child agents (one for fib(X-1) and one for fib(X-2)). You are NOT allowed to compute these yourself. You MUST use child agents.
STEP 2 (only if X >= 2) - Spawn both child agents using this same prompt template with the appropriate numbers.
STEP 3 (only if X >= 2) - Wait for both children, then add their results: fib(X) = fib(X-1) + fib(X-2).
Report: "I spawned [fib(A)](birdhouse:agent/agent_XXX) and [fib(B)](birdhouse:agent/agent_YYY) and added their results: fib(X) = Z"
**fib(X) = Z**
---
STEP 3 - Wait for both children, then add their results: fib(N) = fib(N-1) + fib(N-2).
Report: "I spawned [fib(A)](birdhouse:agent/agent_XXX) and [fib(B)](birdhouse:agent/agent_YYY) and added their results: fib(N) = Z"
**fib(N) = Z**
Replace N with the actual number.
After the root agent completes:
- [fib(N)](birdhouse:agent/agent_ABC)
- [fib(N-1)](birdhouse:agent/agent_DEF)
- [fib(N-2)](birdhouse:agent/agent_GHI)
- [fib(N-2)](birdhouse:agent/agent_JKL)
Include the root agent and all its descendants. Exclude yourself and unrelated agents.
You should output something like:
**fib(3) = 2**
- [fib(3)](birdhouse:agent/agent_A6JMLSRaZ1qySgW_Fm)
- [fib(2)](birdhouse:agent/agent_fSLB47UmKc3SzyxinY)
- [fib(0)](birdhouse:agent/agent_haWQJExKcTeGuoNcL5)
- [fib(1)](birdhouse:agent/agent_7b9ywg4eeqbIWYiXtQ)
- [fib(1)](birdhouse:agent/agent_f1fDvlg3DpOsHcwjkb)
Demonstrates recursive agent delegation by computing Fibonacci numbers where each agent spawns children for sub-problems, creating an exponentially growing tree.