القائمة
For 2D grid problems: mazes, board games, tile maps, pixel grids, coordinate systems, cellular automata, flood fill. Uses dict-based Grid class pattern.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Conducts iterative deep research on any topic using web search, progressive exploration, and structured synthesis. Use when asked for comprehensive research, deep investigation, thorough analysis, or multi-source exploration of any topic. Triggers: research, investigate, deep dive, comprehensive analysis, explore thoroughly, find everything about.
For cross-cutting concerns: add behavior without modifying functions, caching, timing, logging, validation wrappers.
For performance work: measure before changing, profile to find bottlenecks, compare before and after.
For symbolic computation: ASTs, mathematical expressions, code that manipulates code structure, expression transformations.
For ordered processing: A* search, Dijkstra, event simulation, task scheduling. Efficient min/max extraction with heap-based queue.
For dynamic programming: overlapping subproblems, recursive solutions with repeated computations, memoization to avoid redundant work.
| name | solve-grid-maze |
| description | For 2D grid problems: mazes, board games, tile maps, pixel grids, coordinate systems, cellular automata, flood fill. Uses dict-based Grid class pattern. |
Represent grids as dict[(x, y) -> contents] instead of 2D arrays.
Cell = Tuple[int, int]
Grid = Dict[Cell, Any]
# Sparse representation - only store what matters
world = {(3, 1): '#', (1, 2): '.', (1, 3): '#'}
# Neighbors via direction vectors
directions4 = [(1, 0), (0, 1), (-1, 0), (0, -1)] # E, S, W, N
directions8 = directions4 + [(1, 1), (1, -1), (-1, 1), (-1, -1)]
def neighbors(point, directions=directions4):
x, y = point
return [(x + dx, y + dy) for dx, dy in directions]
def add(p, q):
return (p[0] + q[0], p[1] + q[1])
from collections import Counter
Cell = Tuple[int, int]
World = Set[Cell] # Only store live cells (sparse!)
def neighbor_counts(world: World) -> Dict[Cell, int]:
"""Count live neighbors for each cell."""
return Counter(n for cell in world for n in neighbors(cell))
def next_generation(world: World) -> World:
"""Apply Game of Life rules."""
counts = neighbor_counts(world)
return {cell for cell, count in counts.items()
if count == 3 or (count == 2 and cell in world)}