一键在 Manus 中运行任何 Skill

recursion-backtracking

星标66

分支1

更新时间2026年5月17日 09:22

Generate all valid arrangements using backtracking with pruning. Use when solving permutations, combinations, subsets, N-queens, sudoku, or constraint satisfaction problems.

安装

用 Codex 或 Claude 帮你安装复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。

在 Manus 中运行

来源

knoopx

knoopx/pi

打开 GitHub 仓库查看创作者相关仓库

下载

在 Manus 中运行

When to use

Use backtracking for constraint satisfaction and combinatorial generation: permutations, combinations, subsets, N-queens, sudoku, valid arrangements.

Rules

Pattern: make a choice, recurse, undo the choice (backtrack)
Prune early — skip branches that already violate constraints to avoid exploring dead ends
For subsets: at each element, choose to include or exclude it (2^n total)
For permutations: choose each unused element at each position (n! total)
ALWAYS pass state by reference and undo mutations rather than copying
NEVER copy state — it's wasteful and slow
If the problem says "generate all" or "find all valid," backtracking is usually the right approach

Complexity

Subsets: 2^n. Permutations: n!.

Example

Subsets of [1,2,3]: at each element, branch include/exclude. def solve(i): if i==n: yield list(path); return; path.append(nums[i]); solve(i+1); path.pop(); solve(i+1).

同仓库更多 Skills

同仓库

markdown-rendering

knoopx/pi

Renders markdown to self-contained HTML with a custom dark stylesheet and opens in browser. Use when previewing markdown documents, generating styled HTML from README or report files.

2026-05-1966

notify

knoopx/pi

Inform the user what is happening — skip passive lookups

2026-05-1966

jj-core

knoopx/pi

Manage version control with Jujutsu (jj) — no staging area, immediate changes, smart rebasing. Use when navigating history, squashing, or pushing to Git remotes.

2026-05-1966

jj-hunk

knoopx/pi

Programmatic hunk selection for Jujutsu — split, commit, or squash specific hunks without interactive prompts. Use when making partial commits or selective squashes.

2026-05-1966

research-protocol

knoopx/pi

Gather facts from the web using evidence-first approach with mandatory citations. Use when researching topics, answering factual questions, or any task requiring web-sourced evidence.

2026-05-1966

bfs-state-space

knoopx/pi

Model minimum-move problems as BFS over a state space. Use when solving bucket pouring puzzles, sliding tiles, or any problem asking for the shortest sequence of moves to reach a goal.

2026-05-1766

name	recursion-backtracking
description	Generate all valid arrangements using backtracking with pruning. Use when solving permutations, combinations, subsets, N-queens, sudoku, or constraint satisfaction problems.
topic	Backtracking
token_cost	100
related	["dynamic-programming","dfs-vs-bfs"]
keywords	["permutation","combination","subset","backtrack","constraint","generate","valid","recursive","pruning","n-queens","sudoku","exhaustive","all","solutions","choose","pick","arrangement","password","sequence"]

When to use

Use backtracking for constraint satisfaction and combinatorial generation: permutations, combinations, subsets, N-queens, sudoku, valid arrangements.

Rules

Pattern: make a choice, recurse, undo the choice (backtrack)
Prune early — skip branches that already violate constraints to avoid exploring dead ends
For subsets: at each element, choose to include or exclude it (2^n total)
For permutations: choose each unused element at each position (n! total)
ALWAYS pass state by reference and undo mutations rather than copying
NEVER copy state — it's wasteful and slow
If the problem says "generate all" or "find all valid," backtracking is usually the right approach

Complexity

Subsets: 2^n. Permutations: n!.

Example

Subsets of [1,2,3]: at each element, branch include/exclude. def solve(i): if i==n: yield list(path); return; path.append(nums[i]); solve(i+1); path.pop(); solve(i+1).