min-move-solver

Compute minimum move counts for sliding puzzles using BFS.

Updated Mar 3, 2026

Search Tags:#algorithm #pathfinding #state-space #bfs #puzzle-solver #min-move #sliding-puzzle

Ready to run

npx skills add https://github.com/donghyun-bagelcode/2026-ai-jam --skill min-move-solver

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: min-move-solver
Source: https://github.com/donghyun-bagelcode/2026-ai-jam/tree/main/.gemini/skills/min-move-solver
Command: npx skills add https://github.com/donghyun-bagelcode/2026-ai-jam --skill min-move-solver

SYSTEM DOCUMENTATION & REQUIREMENTS

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.

Frequently Asked Questions about min-move-solver

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I find the minimum moves to solve a sliding puzzle with keys and portals?▼

To find the minimum moves for a sliding puzzle, a BFS-based solver explores a state space defined by player position, collected keys, and portal status, guaranteeing an optimal move count for valid layouts.

Can I validate a grid-based puzzle design by checking if it has a solution?▼

Validating grid-based puzzle designs is possible by computing the minimal move count to reach the active portal, which verifies solvability and path feasibility for moderate-sized layouts.

What state space does BFS track when solving sliding puzzles with keys and portals?▼

The BFS state space for sliding puzzles tracks three variables: playerPosition on the grid, collectedKeys acquired during traversal, and portalActive status, ensuring all puzzle dynamics are captured.

What is the best way to compute optimal move counts for small to moderate sliding puzzle grids?▼

Using a BFS-based solver is the best way to compute optimal move counts for small to moderate sliding puzzle grids, as breadth-first search exhaustively checks steps to guarantee the shortest path.

Are there grid size limitations when using BFS to solve sliding puzzles?▼

BFS-based sliding puzzle solvers are limited by state space explosion, making them suitable for small to moderate grids but computationally expensive for larger layouts with many keys and portals.