Token导航 LogoToken导航

Agent Skill · 研究检索

idea-tournament(创意锦标赛)

idea-tournament 用于查找、检索和筛选相关信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要根据关键词、任务场景或来源线索快速定位候选结果时使用。可结合来源仓库、安装命令和原始 README 继续核验具体用法。安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。

idea-tournament 是研究检索类 Agent Skill,可用宿主为 Codex、Claude、Cursor、Gemini CLI,通过GitHub 仓库获取,权限为只读;许可证信息还不明确,第三方扫描有提醒项,按安装量在研究检索类的 73,675 个 Skill 里排第 29,101。

总安装 3,113周安装 131GitHub Stars 346下载 1,090核验 2026-05-01

安装说明

本站只整理中文说明,不托管安装包,也不代用户安装。
GitHub
许可证
unknown

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:idea-tournament(创意锦标赛)
来源仓库:https://github.com/evoscientist/evoskills
仓库路径:skills/idea-tournament
安装命令:
npx skills add https://github.com/evoscientist/evoskills --skill idea-tournament
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。该命令会通过 npx skills 从第三方来源获取 Skill;本站只展示命令,不托管安装包,也不自动执行。

skills.shnpx skills
npx skills add https://github.com/evoscientist/evoskills --skill idea-tournament

这个 Skill 是做什么的

研究检索类 Skill 主要解决「找资料、核对事实、把来源整理清楚」的问题,通常会让助手先检索再总结。

idea-tournament 用于查找、检索和筛选相关信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要根据关键词、任务场景或来源线索快速定位候选结果时使用。适用于创意竞赛、方案比选或公开评审场景。通过关键词搜索和投票机制,帮助 Agent 快速组织想法评比或生成排名结果。

安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。适用宿主包括 Codex、Claude、Cursor、Gemini CLI,接入前应确认版本、权限和运行环境要求。

来源仓库内路径:skills/idea-tournament

上手步骤

4 步
  1. 1

    确认自己的宿主工具

    公开资料标注支持 Codex、Claude、Cursor、Gemini CLI;先确认自己用的是其中之一,再按对应工具的 Skills 目录放置。

  2. 2

    拿到安装命令

    可以直接复制的命令是 npx skills add https://github.com/evoscientist/evoskills --skill idea-tournament;命令里的占位符换成自己的路径或密钥再执行。

  3. 3

    安装后重启宿主

    命令执行完要完全退出宿主工具再打开,让新装的 Skill 被重新扫描到,否则列表里可能看不到。

  4. 4

    按最小权限试用

    它标注为只读,先用只读任务试一次,确认行为符合预期再扩大使用范围。

常见问题

6 条

idea-tournament 怎么安装?

在终端执行 npx skills add https://github.com/evoscientist/evoskills --skill idea-tournament。装完完全退出宿主工具再打开,让它重新扫描本地 Skill。

idea-tournament 支持哪些 AI 工具?

公开资料标注支持 Codex、Claude、Cursor、Gemini CLI。其他工具只要能读取本地 Skill 目录,一般也能手动放进去,但要自己确认触发方式是否一致。

idea-tournament 需要什么权限?

权限级别是只读。该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

idea-tournament 是免费的吗?

公开资料没有标注明确许可证,收费和商用限制都无法确认。正式使用前请到来源仓库核对授权说明。

idea-tournament 用的人多吗?

公开数据是累计安装 3,113 次,近一周安装 131 次,下载 1,090 次,GitHub 346 星。这些数字来自第三方目录统计,只能当作热度参考,不代表质量或安全性。

idea-tournament 安全吗?

第三方扫描有提醒项,说明存在需要人工确认的行为。安装前请打开源码看清它读了什么、联网到哪里。

值得选的地方和要先想清楚的地方

值得选的地方

  • 同时适配 4 种工具,换客户端不用重新找替代品。
  • 标注为只读权限,试用阶段不容易误改本地文件。

先想清楚的地方

  • 许可证没有明确标注,能不能商用、能不能再分发都不确定。
  • 第三方扫描存在提醒项或未通过项,需要人工逐条确认。
  • 第三方目录整理,版本更新和行为细节以来源仓库为准。

适不适合你

更适合

  • 已经在用 Codex,想直接扩展它能力的人。
  • 需要处理研究检索类任务、又不想每次都手写提示词的人。
  • 只想先试试效果、不希望它改动本地文件的人。

不太适合

  • 需要明确授权才能用到公司项目里的场景。
  • 需要厂商级技术支持和 SLA 的生产系统。

研究检索类 Skill 对比

6 个同类
Skill总安装GitHub 星权限许可证扫描
find-skills

寻找技能 · Codex、Claude

31,199,81316,486操作浏览器MIT有提醒
self-improving-agent

自我改进 Agent · OpenClaw

16,464,0023,396接触敏感数据MIT-0通过
soultrace

灵魂追踪 · Codex、Claude

7,588,94412需要联网未明确有提醒
self-improving

自我完善 · OpenClaw

6,829,2841,046需要联网MIT-0通过
microsoft-foundry

微软代工厂 · Codex、Claude

6,614,144764调用外部服务未明确有提醒
idea-tournament

创意锦标赛 · 本页

3,113346只读未明确有提醒

按安装量取同分类前几名;数字来自第三方目录统计,只作热度参考,不代表质量结论。

SKILL.md 原文

Idea Tournament

A structured framework for generating diverse research ideas through tree-based expansion, then selecting the strongest candidate via Elo-rated pairwise tournaments across four quality dimensions.

When to Use This Skill

  • User has a research direction from research-ideation and needs concrete, ranked ideas
  • User wants to systematically compare multiple research ideas before committing
  • User asks about idea ranking, competitive selection, or proposal generation
  • User wants to explore variations of a research concept and select the best one
  • User mentions "idea tournament", "rank ideas", "compare approaches", "research proposal", "which idea is best"

From Direction to Proposal

The gap between "I have a research direction" and "I have a concrete proposal" is where most researchers stall. They either commit to their first idea (missing better alternatives) or endlessly brainstorm without converging (analysis paralysis).

The tournament solves both problems. Phase 1 forces breadth — you generate up to N_I=21 candidates (the paper's maximum) by systematically varying technique, domain, and formulation. Phase 2 forces convergence — pairwise Elo comparisons identify the strongest idea without requiring you to hold all candidates in your head simultaneously.

Before starting:

  1. Load prior knowledge from Ideation Memory (M_I):

- Refer to the evo-memory skill → Read M_I at /memory/ideation-memory.md - Select the top-2 entries (k_I=2) most relevant to the user's current goal by comparing each entry's Summary and Retrieval Tags against the goal - Feasible directions become tree seeds — incorporate them as Level 1 branches in Phase 1 - Unsuccessful directions (fundamental failures only) are used during pruning — prune any tree branch that matches a fundamental failure pattern - If M_I doesn't exist yet (first cycle), skip this step

  1. Retrieve relevant literature L for the user goal G. The paper defines idea tree search as IdeaTreeSearch(G, L, K_I) — literature is a formal input alongside the user goal and retrieved memory. Use web search or provided papers to ground idea generation in existing work.

Phase 1: Tree-Structured Idea Generation

Expand a seed idea into a tree of candidates by varying one axis per level. The tree structure ensures diversity — each branch explores a fundamentally different variation rather than minor tweaks of the same concept.

The Three Axes

LevelAxisWhat VariesExample
0SeedStarting research direction"Efficient LLM inference"
1TechniqueThe core technical approachPruning, quantization, distillation
2DomainThe application contextEdge devices, multi-modal, long-context
3FormulationThe problem framingLatency-constrained, memory-constrained, accuracy-preserving

Expansion Process

Level 0 — Seed (1 node): Start with the research direction from research-ideation. This is your root node.

Level 1 — Technique variants (3 nodes): Generate 3 fundamentally different technical approaches to the seed direction. These should be distinct paradigms, not variations of the same technique. Reflect carefully to verify each is genuinely different.

Level 2 — Domain adaptations (6-9 nodes): For each Level 1 node, generate 2-3 domain-specific adaptations. How does this technique apply differently in different contexts? What domain-specific constraints create new challenges?

Level 3 — Formulation variants (up to N_I=21 total leaves): For each Level 2 node, refine into 1-3 specific problem formulations. A formulation pins down the exact problem statement — the inputs, outputs, constraints, and evaluation criteria. The paper sets N_I=21 as the maximum number of candidate ideas. If the tree produces fewer than 15 leaves, expand Level 2 or Level 3 further. If more than 21, prune to stay within the N_I limit.

Per-Node Cycle: Propose → Review → Refine

For each new node:

  1. Propose: Write a 2-3 sentence description of the idea
  2. Review: Evaluate critically — Is this genuinely different from sibling nodes? Is it at least plausible?
  3. Refine: Sharpen the description based on the review. Remove vague language. Make the novelty claim specific.

Pruning

After expanding each level, prune clearly infeasible branches. A branch is "clearly infeasible" if:

  • It requires resources fundamentally unavailable (e.g., proprietary datasets you can't access)
  • It contradicts well-established theoretical results
  • It duplicates an existing, well-established solution with no meaningful variation
  • It appears in evo-memory's unsuccessful directions as a fundamental failure (not implementation failure)

Important: Pruning removes only the obviously unworkable. Do NOT prune ideas that are risky, unconventional, or outside your current expertise — these are exactly the ideas tournaments are designed to evaluate fairly.

Save the complete tree to /idea-tree.md.

See references/tree-search-protocol.md for detailed expansion rules and diversity metrics.

Phase 2: Elo Tournament Ranking

Rank all leaf candidates through pairwise comparisons on four quality dimensions. Swiss-system pairing keeps the number of comparisons manageable while still producing reliable rankings.

The Four Dimensions

DimensionWeightWhat It Measures
Novelty25%How different is this from existing published work?
Feasibility25%Can this be implemented and validated within reasonable time and resources?
Relevance25%Does this address an important, open problem in the field?
Clarity25%Is the idea well-defined enough to start working on immediately?

All dimensions are weighted equally. Researchers tend to overweight novelty and underweight feasibility — equal weights correct this bias.

Tournament Mechanics

Starting Elo: 1500 for all candidates.

K-factor: 32 (standard for new players; large enough that a few matches significantly move ratings).

Swiss-system pairing (4-5 rounds):

  1. Round 1: Random pairing
  2. Subsequent rounds: Pair candidates with similar current Elo ratings, avoiding rematches
  3. 4-5 rounds is sufficient for 15-21 candidates to produce stable rankings

Per-match process:

  1. Present both candidates side by side with their full descriptions
  2. Score each on all 4 dimensions (1-10 scale)
  3. Compute composite scores (average of 4 dimensions)
  4. Determine the match winner (higher composite score)
  5. Update Elo ratings using the standard formula (see elo-ranking-guide.md for the formula, worked example, and convergence criteria)

Save rankings to /idea-rankings.md.

See references/elo-ranking-guide.md for the detailed rubric and convergence criteria.

Phase 3: Direction Summarization

Synthesize the top-3 ranked ideas into a "promising directions" summary. This serves two purposes: it preserves optionality (the best idea may combine elements from multiple candidates), and it feeds into evo-memory for future cycles.

Summarization Process

For each of the top-3 ideas:

  1. Extract the core research direction (abstract away from specific implementation details)
  2. Identify the key insight that makes this direction promising
  3. Note the primary risk or uncertainty
  4. Check against evo-memory — has this direction been explored before? What was learned?

Then synthesize across the top-3:

  • What common threads run through the top-3? These may suggest an even stronger combined direction.
  • What dimensions do the top ideas excel in? Are there patterns (e.g., all top ideas score high on feasibility but moderate on novelty)?
  • What's missing? Are there important aspects of the original seed that none of the top ideas address?

Save to /direction-summary.md.

After completion, trigger evo-memory IDE (Idea Direction Evolution) to update Ideation Memory with the promising directions identified.

Phase 4: Proposal Extension

Extend the tournament winner (rank #1) into a full research proposal with enough detail to begin implementation.

Proposal Structure

The paper defines proposal P as containing 5 sections: background, related work, method, experiment plan, and expected results. We extend this with a 6th practical section (risks and mitigations).

1. Background: Define the exact problem — inputs, outputs, constraints, and why existing solutions are insufficient. Be specific: "LLM inference on edge devices with <2GB memory while maintaining >90% of full-model accuracy" is a background statement; "make LLMs faster" is not. Include context and motivation.

2. Related Work: Position the idea within the existing literature. What has been tried? What are the gaps? This should draw on the literature L retrieved during Phase 1 tree generation.

3. Proposed Method: Describe the technical approach at a level of detail sufficient for implementation. Include the key insight that differentiates this from prior work. State assumptions explicitly. List 3 testable contributions.

4. Experiment Plan: Datasets, baselines, metrics, and ablation design. This should align with what experiment-pipeline Stage 4 will need. Include both quantitative metrics and qualitative evaluation where appropriate.

5. Expected Results: Quantitative targets (e.g., "15-20% latency reduction with <2% accuracy loss") and qualitative expectations. Being specific about expected results forces you to think about whether the idea is realistic.

6. Risks and Mitigations (practical extension): Technical risks that could prevent success, and fallback plans for each. A proposal without risks is either dishonest or insufficiently analyzed. This section is not in the paper but is valuable for practical research planning.

Save to /research-proposal.md.

See references/proposal-extension.md for detailed guidance on each section.

Counterintuitive Tournament Rules

Prioritize these rules during idea generation and ranking:

  1. Quantity before quality: Generate many candidates before evaluating any. Premature filtering kills diversity. You can't know which idea is strongest until you've seen the alternatives — and the best ideas often emerge from unexpected branches of the tree.
  2. Vary one axis per level: Changing multiple axes simultaneously produces ideas that are different but not meaningfully diverse. Each level of the tree should explore ONE dimension of variation, so you understand exactly what makes each branch unique.
  3. Feasibility is not optional: Brilliant but infeasible ideas waste entire research cycles. A novel idea that can't be validated within your constraints is not a contribution — it's a thought experiment. Weight feasibility equally with novelty.
  4. The tournament finds surprises: Structured pairwise comparison often reveals that your initial favorite isn't actually the strongest idea. Trust the rankings over your gut feeling. If the results surprise you, that means the tournament is working — it's surfacing information you wouldn't have found through intuition alone.
  5. Pruning is not selecting: Prune only clearly infeasible branches. The tournament handles quality ranking. If you aggressively prune before the tournament, you're substituting your initial intuition for systematic comparison — exactly the bias the tournament is designed to correct.
  6. Top-3, not top-1: Summarizing the top 3 directions (not just the winner) preserves optionality. The best final approach may combine elements from multiple top candidates. Committing to exactly one idea too early discards valuable signal.

Handoff to Planning

When the tournament is complete and the proposal is written, pass these artifacts to paper-planning:

ArtifactSource PhaseUsed By
Research proposal (5+1 sections)Phase 4Story design, experiment planning
Idea tree (full structure)Phase 1Related work positioning
Elo rankings with scoresPhase 2Justification for chosen direction
Direction summary (top-3)Phase 3Fallback directions if primary fails
Tournament scorecardsPhase 2Understanding idea strengths/weaknesses

Also pass results to evo-memory for evolution updates:

  • Trigger IDE (Idea Direction Evolution) with the top-3 directions from Phase 3

Skill Integration

Before Starting (load memory)

Refer to the evo-memory skill to read Ideation Memory: → Read M_I at /memory/ideation-memory.md

After Phase 3 (update memory)

Refer to the evo-memory skill and trigger IDE: → Run IDE protocol with /direction-summary.md

After Phase 4 (handoff to planning)

Refer to the paper-planning skill: → Pass /research-proposal.md

Reference Navigation

TopicReference FileWhen to Use
Tree expansion rules and diversitytree-search-protocol.mdGenerating diverse idea candidates
Elo formula, rubric, and pairingelo-ranking-guide.mdRunning the tournament
Proposal section guidanceproposal-extension.mdWriting the research proposal
Idea candidate templateidea-candidate-template.mdDescribing individual ideas
Ranking scorecard templateranking-scorecard-template.mdRecording pairwise comparisons
Direction summary templatedirection-summary-template.mdSynthesizing top-3 directions

平台分布

Codex

31.72%
按下载量换算346

Claude

31.24%
按下载量换算341

Cursor

19.76%
按下载量换算215

Gemini CLI

9.93%
按下载量换算108

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

可疑

权限和风险

只读

该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。来源安全扫描存在提醒或未通过项,安装前请自行复核。目前只有一个公开来源,建议同时核对源仓库。

继续浏览同类 Skills