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.From its SKILL.md
npx -y skills add ECNU-ICALK/AutoSkill --skill solve-binary-puzzle-with-backtrackingAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
One thing to look at
- no licenseNo license file was found in the repository. Code published without one is not open source by default, so using it at work is a question for whoever answers licensing questions where you are.
SKILL.md
1.7 KB, 258 tokens by cl100k_base, as published. Nobody here has run it
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:
- Each cell must contain either a 0 or a 1.
- No three consecutive 0s or 1s are allowed in any row or column.
- Each row and each column must contain an equal number of 0s and 1s.
- No two rows and no two columns can be identical.
- 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 ships with it
Read from the repository
Just SKILL.md. No reference files, no scripts.