min-move-solver
CommunityMinimum moves solver for sliding puzzles with BFS
Authordonghyun-bagelcode
Version1.0.0
Installs0
System Documentation
What problem does it solve?
The Min Move Solver computes the minimum number of moves to solve a sliding puzzle, enabling efficient puzzle verification and performance analysis.
Core Features & Use Cases
- BFS-based search guarantees optimal move counts for small to moderate sliding puzzle grids.
- State-space modeling using (playerPosition, collectedKeys, portalActive) to capture puzzle dynamics like keys and portals.
- Use Case: validate puzzle designs by determining the minimum M for given layouts and verify solvability paths.
Quick Start
Provide the initial puzzle state, target portal, and any required keys to compute the minimal move count.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: min-move-solver Download link: https://github.com/donghyun-bagelcode/2026-ai-jam/archive/main.zip#min-move-solver Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 510,000+ vetted skills library on demand.