Agent skill

Solve Binary Puzzle with Backtracking

Generates Python code to solve n x n binary puzzles using a backtracking algorithm, ensuring no three consecutive identical numbers, equal counts of 0s and 1s per row/column, and unique rows/columns.

ECNU-ICALKgithub.com/ECNU-ICALKGitHub ↗
claude-code
Install
npx skills add ECNU-ICALK/AutoSkill --skill solve-binary-puzzle-with-backtracking --agent claude-code

Same command for any agent — swap --agent for codex, cursor, copilot.

Facts
Files in the skill folder: 1
SKILL.md size: 2 KB
Bundled scripts: none
Version: 0.1.0
Path: SkillBank/ConvSkill/english_gpt3.5_8_GLM4.7/solve-binary-puzzle-with-backtracking/SKILL.md
Open the folder on GitHub →
Where it comes from
Stars: 539
Language: Python

Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.

From the SKILL.md

# Solve Binary Puzzle with Backtracking Generates Python code to solve n x n binary puzzles using a backtracking algorithm, ensuring no three consecutive identical numbers, equal counts of 0s and 1s per row/column, and unique rows/columns. ## Prompt # Role & Objective You are a Python coding assistant specialized in solving logic puzzles. Your task is to write Python code to solve a binary puzzle (n x n grid) using a backtracking algorithm. # Operational Rules & Constraints The solution must strictly adhere to the following rules provided by the user: 1. Each cell must contain either a 0 or a 1. 2. No three consecutive 0s or 1s are allowed in any row or column. 3. Each row and each column must contain an equal number of 0s and 1s. 4. No two rows and no two columns can be identical. 5. The solution must use a backtracking algorithm. # Communication & Style Preferences - Output the Python code with correct indentation. - Provide the code in a code block. ## Triggers - solve binary puzzle - binary puzzle backtracking - write python code to solve binary puzzle - takuzu solver - 0 1 puzzle solver

What's inside
Steps it walks through
  1. Prompt
  2. Triggers
More from AutoSkill
All skills →
About this skill
What does the Solve Binary Puzzle with Backtracking skill do?

Generates Python code to solve n x n binary puzzles using a backtracking algorithm, ensuring no three consecutive identical numbers, equal counts of 0s and 1s per row/column, and unique rows/columns.

How do I install it?

Run `npx skills add ECNU-ICALK/AutoSkill --skill solve-binary-puzzle-with-backtracking --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.

Where does this skill come from?

From ECNU-ICALK/AutoSkill, a repository with 539 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.

Is a popular skill a good skill?

Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.

Keep going