analyze-complexity

Task complexity analysis evaluates word count, ambiguity, dependencies, and domain specificity to generate a 0.0-1.0 complexity score. This structured assessment routes your prompt to the most effective meta-prompting strategy for optimal outcomes.

Task complexity for algorithm selection is evaluated using four primary factors: word count, ambiguity level, dependency depth, and domain specificity. These metrics combine to form a structured assessment that recommends the optimal handling approach.

Direct execution suits low-complexity tasks with minimal ambiguity and dependencies, while autonomous evolution and multi-approach synthesis are recommended for high complexity scores involving deep domain specificity and intricate dependencies.

Yes, you can assess a distributed cache system design task by analyzing its word count, ambiguity, dependencies, and domain specificity. This returns a complexity score and a recommended meta-prompting strategy for the task.

Yes, the task complexity analysis requires the meta-prompting engine to process task descriptions and route them to appropriate approaches like direct execution, multi-approach synthesis, or autonomous evolution based on the complexity score.