Tiling Tree Explorer

What it does

Implements a recursive partitioning method to explore a problem space exhaustively. It breaks a complex problem into Mutually Exclusive and Collectively Exhaustive (MECE) subsets, effectively 'tiling' the solution space to ensure no potential approach is overlooked.

When to use it

Use this when you need to map all possible ways to solve a problem, avoid binary thinking traps, or conduct a comprehensive brainstorming session where structural completeness is required.

What's included

• Scripts: Includes a tiling_tree.py orchestrator that manages parallel subagent calls for splitting and final evaluation.
• Instructions: Provides guidelines on setting recursion depth and defining split criteria.

Compatible agents

Designed for Claude-based agents capable of orchestrating parallel sub-agents.