Implements efficient pathfinding and state-space search algorithms using standardized Norvig-inspired coding patterns.
The Find Shortest Path skill provides a robust framework for solving complex navigation and optimization problems within Claude Code. Drawing inspiration from Peter Norvig's algorithmic patterns, it enables Claude to implement A* search, Dijkstra, and breadth-first search with a clean separation between problem logic and search mechanics. This skill is ideal for tasks ranging from grid-based maze solving and game AI movement to abstract state-space puzzles like the 15-puzzle, ensuring optimal solutions through consistent, heuristic-driven implementations.
주요 기능
01Priority queue optimization with heapq
02Cycle detection and reached-state tracking
031 GitHub stars
04State-space problem abstraction
05Custom heuristic and cost function support
06A* search algorithm implementation
사용 사례
01Designing AI movement and navigation for grid-based games.
02Solving complex state-space puzzles like the 15-puzzle or Rubik's Cube.
03Optimizing route planning and graph traversal in network structures.
