[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M79M7DSJYEW2MFZ0VWGTYCT3":3,"skill-same:01M79M7DSJYEW2MFZ0VWGTYCT3":60},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":30,"commitSha":31,"skillDirectory":5,"forksCount":14,"repositoryHtmlUrl":32,"repositoryHomepageUrl":6,"ownerHtmlUrl":33,"ownerBlogUrl":6,"ownerDescription":34,"updatedAt":35,"install":36,"resources":49},"01M79M7DSJYEW2MFZ0VWGTYCT3","game-ai",null,"Design NPC and enemy decision-making with finite state machines, behavior trees, steering behaviors, and A* pathfinding — engine-neutral algorithms that pair with the detected engine's navigation API. Use when building enemy AI, an FSM or behavior tree, steering\u002Fflocking, or pathfinding, or when the user mentions state machine, behavior tree, blackboard, A*, navmesh, seek, or patrol\u002Fchase.","mistervaibhav\u002Fskills","mistervaibhav","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F41189028?v=4","01M79KACH05EG9FMM6DQVHAVK9","Vaibhav Singh","01M79KACJB3431Y8CFJQ02MTTM",0,"Apache-2.0","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fgame-ai\u002FSKILL.md",[],[],"2026-11-15 14:19:17",false,"---\nname: game-ai\ndescription: >\n  Design NPC and enemy decision-making with finite state machines, behavior\n  trees, steering behaviors, and A* pathfinding — engine-neutral algorithms\n  that pair with the detected engine's navigation API. Use when building enemy\n  AI, an FSM or behavior tree, steering\u002Fflocking, or pathfinding, or when the\n  user mentions state machine, behavior tree, blackboard, A*, navmesh, seek, or\n  patrol\u002Fchase.\nlicense: Apache-2.0\ncompatibility: Engine-agnostic (algorithms). Concrete snippets in GDScript-like \u002F Python pseudocode; pairs with unity-navmesh, unreal-behavior-trees, or Godot NavigationServer.\nmetadata:\n  engine: none\n  category: disciplines\n  difficulty: advanced\n---\n\n# Game AI: decisions, steering, and pathfinding\n\nBuild believable NPC behavior from three separable layers: **decide** (what to\ndo), **steer** (how to move there), and **path** (how to route around the map).\nKeep them decoupled — a behavior tree picks a target, the pathfinder produces\nwaypoints, steering follows them. This skill teaches the engine-neutral\nalgorithms; bind them to your engine via the related skills below.\n\n## When to use\n\n- Use when implementing enemy\u002FNPC logic: patrols, chase\u002Fflee, guard states,\n  group movement, or \"find a path to the player\".\n- Use to choose between an **FSM** (few clear states), a **behavior tree** (many\n  reactive behaviors with priorities), or **steering** (smooth local movement).\n- Use when integrating pathfinding: A* on a grid\u002Fgraph, or driving an engine\n  navmesh agent.\n\n**When *not* to use:** for the engine's concrete navmesh\u002Fagent API and baking,\nuse `unity-navmesh`, `unreal-behavior-trees`, or Godot's `NavigationAgent2D\u002F3D`\n(see that engine skill). For movement\u002Fcollision feel, use `physics-tuning`. For\nspawning waves along lanes, see the `tower-defense` genre skill.\n\n## Core workflow\n\n1. **Pick the decision model by complexity.** 2–5 states with obvious\n   transitions → FSM. Many behaviors, priorities, interruption, reuse → behavior\n   tree. Continuous \"how strongly do I want each option\" → utility scoring.\n2. **Separate decision from motion.** The decision layer outputs an *intent*\n   (target position, action). Steering or pathfinding turns intent into motion.\n3. **Path on the right graph.** Grid tiles, waypoint graph, or a baked navmesh.\n   Fewer nodes = faster A*. Prefer the engine's navmesh for 3D; A* on a grid for\n   tile games.\n4. **Steer along the path**, not straight to the goal — follow the next waypoint,\n   advancing when close, so agents round corners.\n5. **Recompute paths sparingly.** Pathfind on a timer or when the goal moves a\n   tile, not every frame. Cache the path; only the waypoint index advances.\n6. **Verify by observation.** Watch the agent: does it reach the goal, get stuck\n   on corners, oscillate between states? Draw the path and current state on\n   screen while tuning.\n\n## Patterns\n\n### 1. Finite state machine (one state object, explicit transitions)\n\n```gdscript\n# Each state is a small object with enter\u002Fupdate\u002Fexit. The machine owns \"current\".\nclass_name State\nfunc enter(agent): pass\nfunc update(agent, dt) -> State: return null   # return a new state to transition\nfunc exit(agent): pass\n\n# --- Chase state: returns Patrol when the player escapes sight range ---\nclass Chase extends State:\n    func update(agent, dt) -> State:\n        if not agent.can_see(agent.target):\n            return Patrol.new()                 # transition by returning next state\n        agent.move_toward(agent.target.position, dt)\n        return null                             # null = stay in this state\n\n# --- Driver: call once per frame ---\nfunc tick(dt):\n    var next = current.update(self, dt)\n    if next != null:\n        current.exit(self); next.enter(self); current = next\n```\n\nKeep transition logic *inside* states (or in a table), never as a growing pile\nof `if` flags. One state owns one behavior; that is what keeps an FSM readable.\n\n### 2. Behavior tree tick (composite nodes return a status)\n\n```gdscript\n# A node's tick() returns SUCCESS, FAILURE, or RUNNING (still working this frame).\nenum Status { SUCCESS, FAILURE, RUNNING }\n\n# Sequence: run children in order; stop at the first non-SUCCESS (logical AND).\nfunc sequence_tick(children, agent, dt) -> int:\n    for child in children:\n        var s = child.tick(agent, dt)\n        if s != Status.SUCCESS:\n            return s                 # FAILURE or RUNNING short-circuits the sequence\n    return Status.SUCCESS\n\n# Selector: try children until one succeeds or is RUNNING (logical OR \u002F fallback).\nfunc selector_tick(children, agent, dt) -> int:\n    for child in children:\n        var s = child.tick(agent, dt)\n        if s != Status.FAILURE:\n            return s                 # SUCCESS or RUNNING stops the search\n    return Status.FAILURE\n```\n\nA guard AI reads top-down: `Selector[ Sequence[CanSeePlayer?, Chase], Patrol ]`\n— chase if visible, otherwise patrol. See `references\u002Fbehavior-trees.md` for\nleaf nodes, decorators (Inverter, Cooldown), and a blackboard.\n\n### 3. Steering: seek and arrive (smooth, frame-rate independent)\n\n```gdscript\n# Seek: accelerate toward a target at full speed. Steering = desired - current.\nfunc seek(pos, vel, target, max_speed, max_force) -> Vector2:\n    var desired = (target - pos).normalized() * max_speed\n    return (desired - vel).limit_length(max_force)   # a force, not a teleport\n\n# Arrive: like seek, but ramp speed down inside slow_radius so it stops cleanly.\nfunc arrive(pos, vel, target, max_speed, max_force, slow_radius) -> Vector2:\n    var offset = target - pos\n    var dist = offset.length()\n    if dist \u003C 0.001: return -vel                      # already there: kill drift\n    var ramped = max_speed * min(dist \u002F slow_radius, 1.0)\n    var desired = offset \u002F dist * ramped\n    return (desired - vel).limit_length(max_force)\n\n# Per frame: vel += steering * dt; pos += vel * dt   (always scale by dt)\n```\n\n### 4. A* heuristic must not overestimate (or paths stop being shortest)\n\n```python\n# Match the heuristic to the movement. An ADMISSIBLE heuristic (never larger\n# than the true remaining cost) keeps A* optimal.\ndef heuristic(a, b):\n    dx, dy = abs(a.x - b.x), abs(a.y - b.y)\n    # return dx + dy             # Manhattan: 4-direction grids (no diagonals)\n    return (dx + dy) + (1.414 - 2) * min(dx, dy)   # octile: 8-direction grids\n# f(n) = g(n) + h(n): g = cost from start, h = heuristic to goal.\n# Overestimating h is faster but no longer guarantees the shortest path.\n```\n\nThe full A* loop (priority queue, `came_from` reconstruction, grid + waypoint\ngraphs) is in `references\u002Fpathfinding.md`.\n\n## Pitfalls\n\n- **Pathfinding every frame** tanks the frame rate. Recompute on a timer or only\n  when the target moves to a new tile; follow the cached waypoints in between.\n- **Steering straight to the goal** instead of to the next waypoint makes agents\n  hug walls and corners. Follow the path; advance the waypoint when within radius.\n- **Inadmissible A\\* heuristic** (e.g. Euclidean distance scaled up, or Manhattan\n  on a diagonal grid) returns fast but *non-shortest* paths. Pick the heuristic\n  that matches your allowed moves.\n- **Behavior tree leaves that never return RUNNING** for multi-frame actions\n  (walking, playing an animation) cause the tree to restart the action every\n  tick. Return RUNNING until the action completes.\n- **FSM transition spaghetti**: scattering `if state == ...` checks everywhere\n  recreates the mess an FSM exists to prevent. Keep transitions in the state.\n- **No line-of-sight or stuck check** → agents grind into walls forever. Add a\n  timeout that forces a repath or a state change.\n\n## References\n\n- `references\u002Fpathfinding.md` — complete A* (priority queue, reconstruction),\n  grid vs waypoint graphs, when to defer to an engine navmesh.\n- `references\u002Fbehavior-trees.md` — node taxonomy, leaf\u002Fdecorator implementations,\n  blackboard, and FSM-vs-BT selection.\n\n## Related skills\n\n- `unity-navmesh`, `unreal-behavior-trees` — concrete engine AI\u002Fnavigation APIs.\n- `physics-tuning` — movement, collision response, and agent radius.\n- `procedural-gen` — generating the graph\u002Flevel the AI navigates.\n- `tower-defense`, `fps-shooter` — genres that compose this skill.\n","# Game AI: decisions, steering, and pathfinding\n\nBuild believable NPC behavior from three separable layers: **decide** (what to\ndo), **steer** (how to move there), and **path** (how to route around the map).\nKeep them decoupled — a behavior tree picks a target, the pathfinder produces\nwaypoints, steering follows them. This skill teaches the engine-neutral\nalgorithms; bind them to your engine via the related skills below.\n\n## When to use\n\n- Use when implementing enemy\u002FNPC logic: patrols, chase\u002Fflee, guard states,\n  group movement, or \"find a path to the player\".\n- Use to choose between an **FSM** (few clear states), a **behavior tree** (many\n  reactive behaviors with priorities), or **steering** (smooth local movement).\n- Use when integrating pathfinding: A* on a grid\u002Fgraph, or driving an engine\n  navmesh agent.\n\n**When *not* to use:** for the engine's concrete navmesh\u002Fagent API and baking,\nuse `unity-navmesh`, `unreal-behavior-trees`, or Godot's `NavigationAgent2D\u002F3D`\n(see that engine skill). For movement\u002Fcollision feel, use `physics-tuning`. For\nspawning waves along lanes, see the `tower-defense` genre skill.\n\n## Core workflow\n\n1. **Pick the decision model by complexity.** 2–5 states with obvious\n   transitions → FSM. Many behaviors, priorities, interruption, reuse → behavior\n   tree. Continuous \"how strongly do I want each option\" → utility scoring.\n2. **Separate decision from motion.** The decision layer outputs an *intent*\n   (target position, action). Steering or pathfinding turns intent into motion.\n3. **Path on the right graph.** Grid tiles, waypoint graph, or a baked navmesh.\n   Fewer nodes = faster A*. Prefer the engine's navmesh for 3D; A* on a grid for\n   tile games.\n4. **Steer along the path**, not straight to the goal — follow the next waypoint,\n   advancing when close, so agents round corners.\n5. **Recompute paths sparingly.** Pathfind on a timer or when the goal moves a\n   tile, not every frame. Cache the path; only the waypoint index advances.\n6. **Verify by observation.** Watch the agent: does it reach the goal, get stuck\n   on corners, oscillate between states? Draw the path and current state on\n   screen while tuning.\n\n## Patterns\n\n### 1. Finite state machine (one state object, explicit transitions)\n\n```gdscript\n# Each state is a small object with enter\u002Fupdate\u002Fexit. The machine owns \"current\".\nclass_name State\nfunc enter(agent): pass\nfunc update(agent, dt) -> State: return null   # return a new state to transition\nfunc exit(agent): pass\n\n# --- Chase state: returns Patrol when the player escapes sight range ---\nclass Chase extends State:\n    func update(agent, dt) -> State:\n        if not agent.can_see(agent.target):\n            return Patrol.new()                 # transition by returning next state\n        agent.move_toward(agent.target.position, dt)\n        return null                             # null = stay in this state\n\n# --- Driver: call once per frame ---\nfunc tick(dt):\n    var next = current.update(self, dt)\n    if next != null:\n        current.exit(self); next.enter(self); current = next\n```\n\nKeep transition logic *inside* states (or in a table), never as a growing pile\nof `if` flags. One state owns one behavior; that is what keeps an FSM readable.\n\n### 2. Behavior tree tick (composite nodes return a status)\n\n```gdscript\n# A node's tick() returns SUCCESS, FAILURE, or RUNNING (still working this frame).\nenum Status { SUCCESS, FAILURE, RUNNING }\n\n# Sequence: run children in order; stop at the first non-SUCCESS (logical AND).\nfunc sequence_tick(children, agent, dt) -> int:\n    for child in children:\n        var s = child.tick(agent, dt)\n        if s != Status.SUCCESS:\n            return s                 # FAILURE or RUNNING short-circuits the sequence\n    return Status.SUCCESS\n\n# Selector: try children until one succeeds or is RUNNING (logical OR \u002F fallback).\nfunc selector_tick(children, agent, dt) -> int:\n    for child in children:\n        var s = child.tick(agent, dt)\n        if s != Status.FAILURE:\n            return s                 # SUCCESS or RUNNING stops the search\n    return Status.FAILURE\n```\n\nA guard AI reads top-down: `Selector[ Sequence[CanSeePlayer?, Chase], Patrol ]`\n— chase if visible, otherwise patrol. See `references\u002Fbehavior-trees.md` for\nleaf nodes, decorators (Inverter, Cooldown), and a blackboard.\n\n### 3. Steering: seek and arrive (smooth, frame-rate independent)\n\n```gdscript\n# Seek: accelerate toward a target at full speed. Steering = desired - current.\nfunc seek(pos, vel, target, max_speed, max_force) -> Vector2:\n    var desired = (target - pos).normalized() * max_speed\n    return (desired - vel).limit_length(max_force)   # a force, not a teleport\n\n# Arrive: like seek, but ramp speed down inside slow_radius so it stops cleanly.\nfunc arrive(pos, vel, target, max_speed, max_force, slow_radius) -> Vector2:\n    var offset = target - pos\n    var dist = offset.length()\n    if dist \u003C 0.001: return -vel                      # already there: kill drift\n    var ramped = max_speed * min(dist \u002F slow_radius, 1.0)\n    var desired = offset \u002F dist * ramped\n    return (desired - vel).limit_length(max_force)\n\n# Per frame: vel += steering * dt; pos += vel * dt   (always scale by dt)\n```\n\n### 4. A* heuristic must not overestimate (or paths stop being shortest)\n\n```python\n# Match the heuristic to the movement. An ADMISSIBLE heuristic (never larger\n# than the true remaining cost) keeps A* optimal.\ndef heuristic(a, b):\n    dx, dy = abs(a.x - b.x), abs(a.y - b.y)\n    # return dx + dy             # Manhattan: 4-direction grids (no diagonals)\n    return (dx + dy) + (1.414 - 2) * min(dx, dy)   # octile: 8-direction grids\n# f(n) = g(n) + h(n): g = cost from start, h = heuristic to goal.\n# Overestimating h is faster but no longer guarantees the shortest path.\n```\n\nThe full A* loop (priority queue, `came_from` reconstruction, grid + waypoint\ngraphs) is in `references\u002Fpathfinding.md`.\n\n## Pitfalls\n\n- **Pathfinding every frame** tanks the frame rate. Recompute on a timer or only\n  when the target moves to a new tile; follow the cached waypoints in between.\n- **Steering straight to the goal** instead of to the next waypoint makes agents\n  hug walls and corners. Follow the path; advance the waypoint when within radius.\n- **Inadmissible A\\* heuristic** (e.g. Euclidean distance scaled up, or Manhattan\n  on a diagonal grid) returns fast but *non-shortest* paths. Pick the heuristic\n  that matches your allowed moves.\n- **Behavior tree leaves that never return RUNNING** for multi-frame actions\n  (walking, playing an animation) cause the tree to restart the action every\n  tick. Return RUNNING until the action completes.\n- **FSM transition spaghetti**: scattering `if state == ...` checks everywhere\n  recreates the mess an FSM exists to prevent. Keep transitions in the state.\n- **No line-of-sight or stuck check** → agents grind into walls forever. Add a\n  timeout that forces a repath or a state change.\n\n## References\n\n- `references\u002Fpathfinding.md` — complete A* (priority queue, reconstruction),\n  grid vs waypoint graphs, when to defer to an engine navmesh.\n- `references\u002Fbehavior-trees.md` — node taxonomy, leaf\u002Fdecorator implementations,\n  blackboard, and FSM-vs-BT selection.\n\n## Related skills\n\n- `unity-navmesh`, `unreal-behavior-trees` — concrete engine AI\u002Fnavigation APIs.\n- `physics-tuning` — movement, collision response, and agent radius.\n- `procedural-gen` — generating the graph\u002Flevel the AI navigates.\n- `tower-defense`, `fps-shooter` — genres that compose this skill.\n",{"name":5,"license":15,"metadata":24,"description":28,"compatibility":29},{"engine":25,"category":26,"difficulty":27},"none","disciplines","advanced","Design NPC and enemy decision-making with finite state machines, behavior trees, steering behaviors, and A* pathfinding — engine-neutral algorithms that pair with the detected engine's navigation API. Use when building enemy AI, an FSM or behavior tree, steering\u002Fflocking, or pathfinding, or when the user mentions state machine, behavior tree, blackboard, A*, navmesh, seek, or patrol\u002Fchase.\n","Engine-agnostic (algorithms). Concrete snippets in GDScript-like \u002F Python pseudocode; pairs with unity-navmesh, unreal-behavior-trees, or Godot NavigationServer.","main","6d4e3296d58b2720c5b1026197cd069b1dde4789","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills","https:\u002F\u002Fgithub.com\u002Fmistervaibhav","Software Engineer","2026-07-24 17:16:42",{"source":8,"skillName":5,"commands":37,"prompt":47,"zipAvailable":48},[38,41,44],{"tool":39,"command":40},"npx","npx skills add mistervaibhav\u002Fskills --skill game-ai",{"tool":42,"command":43},"bunx","bunx skills add mistervaibhav\u002Fskills --skill game-ai",{"tool":45,"command":46},"pnpm","pnpm dlx skills add mistervaibhav\u002Fskills --skill game-ai","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fgame-ai\u002FSKILL.md",true,[50,56],{"path":51,"resourceType":52,"resourceTypeDesc":53,"sizeBytes":54,"sourceHtmlUrl":55},"references\u002Fbehavior-trees.md","REFERENCE","参考文档",4944,"https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fgame-ai\u002Freferences\u002Fbehavior-trees.md",{"path":57,"resourceType":52,"resourceTypeDesc":53,"sizeBytes":58,"sourceHtmlUrl":59},"references\u002Fpathfinding.md",4900,"https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fgame-ai\u002Freferences\u002Fpathfinding.md",[61,69,77,85,92,99],{"skillNo":62,"name":63,"nameZh":6,"description":64,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":65,"sourceHtmlUrl":66,"categories":67,"keywords":68,"publishedAt":19},"01M79NZDV5781GA6SJMN1QPXB4","webapp-testing","Toolkit for interacting with and testing local web applications using Playwright. Supports verifying frontend functionality, debugging UI behavior, capturing browser screenshots, and viewing browser logs.","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fwebapp-testing\u002FLICENSE.txt","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fwebapp-testing\u002FSKILL.md",[],[],{"skillNo":70,"name":71,"nameZh":6,"description":72,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":73,"licenseFileUrl":6,"sourceHtmlUrl":74,"categories":75,"keywords":76,"publishedAt":19},"01M79NZ8SEVWT4WYD49BV980YW","web-typography","Select, pair, and implement typefaces for web projects. Use when the user mentions \"font pairing\", \"which typeface\", \"line height\", \"responsive typography\", \"web font loading\", or \"type hierarchy\". Covers readability evaluation, CSS implementation, and performance optimization. For overall UI design systems, see refactoring-ui. For dramatic typographic experiences, see top-design.","MIT","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fweb-typography\u002FSKILL.md",[],[],{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":73,"licenseFileUrl":81,"sourceHtmlUrl":82,"categories":83,"keywords":84,"publishedAt":19},"01M79NYVQS5NYHH36NXF2AHP8B","web-haptics","Add haptic feedback to web apps using the web-haptics library. Use when building mobile-facing UIs that need tactile feedback on buttons, toggles, forms, pickers, and other interactive elements.","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fweb-haptics\u002FLICENSE","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fweb-haptics\u002FSKILL.md",[],[],{"skillNo":86,"name":87,"nameZh":6,"description":88,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":89,"categories":90,"keywords":91,"publishedAt":19},"01M79NY8AMC62DDRSH21WKXJVE","visual-novel","Build a visual novel: a branching script, character and background display, a text box with choices, save\u002Fload, backlog, and skip\u002Fauto. Use for a VN, dating sim, or branching story game.","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fvisual-novel\u002FSKILL.md",[],[],{"skillNo":93,"name":94,"nameZh":6,"description":95,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":73,"licenseFileUrl":6,"sourceHtmlUrl":96,"categories":97,"keywords":98,"publishedAt":19},"01M79NWFM5R9QC9Y2AT40EHF44","ux-heuristics","Evaluate and improve interface usability using heuristic analysis. Use when the user mentions \"usability audit\", \"UX review\", \"users are confused\", \"heuristic evaluation\", \"form usability\", or \"navigation problems\". Covers Nielsen's 10 heuristics, severity ratings, and information architecture. For visual design fixes, see refactoring-ui. For conversion-focused audits, see cro-methodology.","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Fux-heuristics\u002FSKILL.md",[],[],{"skillNo":100,"name":101,"nameZh":6,"description":102,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":103,"categories":104,"keywords":105,"publishedAt":19},"01M79NVSG7AB3MSFT8Y6EEHG1B","unreal-packaging","Package and ship an Unreal Engine 5 project: the Platforms menu Package Project flow, build configurations (Development vs Shipping), cooking content, packaging settings and the Game Default Map, and command-line builds with RunUAT BuildCookRun. Use when packaging a build, making a shipping build, cooking content, configuring packaging settings, or when the user mentions package Unreal, cook content, shipping build, or BuildCookRun.","https:\u002F\u002Fgithub.com\u002Fmistervaibhav\u002Fskills\u002Fblob\u002Fmain\u002Funreal-packaging\u002FSKILL.md",[],[]]