[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6CXJMZKTYEWD5N620C81E8S":3,"skill-same:01M6CXJMZKTYEWD5N620C81E8S":79},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":25,"linkOnly":26,"markdownContent":27,"markdownBody":28,"frontMatter":29,"refName":33,"commitSha":34,"skillDirectory":5,"forksCount":35,"repositoryHtmlUrl":36,"repositoryHomepageUrl":6,"ownerHtmlUrl":37,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":38,"install":39,"resources":52},"01M6CXJMZKTYEWD5N620C81E8S","search-algorithms",null,"Search algorithms in AI","ffsshhttiikk\u002Fopencode-agents-skills","ffsshhttiikk","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F226346827?v=4","01M6CWD9RR3Y7VRQX3MXYC8FYH","01M6CWD9WVPYAZW0J82G1VKGHY",3,"MIT","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fsearch-algorithms\u002FSKILL.md",[],[18,19,20,21,22,23,24],"search","algorithms","search algorithms","machine-learning","learning","opencode","intelligence","2026-11-10 10:12:30",false,"---\nname: search-algorithms\ndescription: Search algorithms in AI\nlicense: MIT\ncompatibility: opencode\nmetadata:\n  audience: machine-learning-engineers\n  category: artificial-intelligence\n---\n\n## What I do\n\n- Implement search algorithms\n- Solve pathfinding problems\n- Optimize search strategies\n- Apply heuristic search\n- Handle adversarial search\n\n## When to use me\n\nUse me when:\n- Finding optimal paths\n- Game playing\n- Puzzle solving\n- Route planning\n\n## Key Concepts\n\n### Search Categories\n- **Uninformed**: BFS, DFS, Uniform-cost\n- **Informed**: A*, Greedy, IDA*\n- **Adversarial**: Minimax, Alpha-beta\n- **Local**: Hill climbing, Simulated annealing\n\n### A* Implementation\n```python\nimport heapq\n\ndef astar(start, goal, neighbors, heuristic):\n    frontier = [(0, start)]\n    came_from = {start: None}\n    cost_so_far = {start: 0}\n    \n    while frontier:\n        _, current = heapq.heappop(frontier)\n        \n        if current == goal:\n            return reconstruct_path(came_from, current)\n        \n        for next_node in neighbors(current):\n            new_cost = cost_so_far[current] + cost(current, next_node)\n            \n            if next_node not in cost_so_far or new_cost \u003C cost_so_far[next_node]:\n                cost_so_far[next_node] = new_cost\n                priority = new_cost + heuristic(next_node, goal)\n                heapq.heappush(frontier, (priority, next_node))\n                came_from[next_node] = current\n    \n    return None\n```\n\n### Minimax for Games\n```python\ndef minimax(board, depth, is_maximizing):\n    if is_terminal(board) or depth == 0:\n        return evaluate(board)\n    \n    if is_maximizing:\n        max_eval = -inf\n        for move in get_moves(board):\n            eval = minimax(make_move(board, move), depth - 1, False)\n            max_eval = max(max_eval, eval)\n        return max_eval\n    else:\n        min_eval = inf\n        for move in get_moves(board):\n            eval = minimax(make_move(board, move), depth - 1, True)\n            min_eval = min(min_eval, eval)\n        return min_eval\n\n# Alpha-beta pruning\ndef alphabeta(board, depth, alpha, beta, is_maximizing):\n    if is_terminal(board) or depth == 0:\n        return evaluate(board)\n    \n    if is_maximizing:\n        max_eval = -inf\n        for move in get_moves(board):\n            eval = alphabeta(make_move(board, move), depth - 1, \n                          alpha, beta, False)\n            max_eval = max(max_eval, eval)\n            alpha = max(alpha, eval)\n            if beta \u003C= alpha:\n                break\n        return max_eval\n    else:\n        min_eval = inf\n        for move in get_moves(board):\n            eval = alphabeta(make_move(board, move), depth - 1,\n                          alpha, beta, True)\n            min_eval = min(min_eval, eval)\n            beta = min(beta, eval)\n            if beta \u003C= alpha:\n                break\n        return min_eval\n```\n","## What I do\n\n- Implement search algorithms\n- Solve pathfinding problems\n- Optimize search strategies\n- Apply heuristic search\n- Handle adversarial search\n\n## When to use me\n\nUse me when:\n- Finding optimal paths\n- Game playing\n- Puzzle solving\n- Route planning\n\n## Key Concepts\n\n### Search Categories\n- **Uninformed**: BFS, DFS, Uniform-cost\n- **Informed**: A*, Greedy, IDA*\n- **Adversarial**: Minimax, Alpha-beta\n- **Local**: Hill climbing, Simulated annealing\n\n### A* Implementation\n```python\nimport heapq\n\ndef astar(start, goal, neighbors, heuristic):\n    frontier = [(0, start)]\n    came_from = {start: None}\n    cost_so_far = {start: 0}\n    \n    while frontier:\n        _, current = heapq.heappop(frontier)\n        \n        if current == goal:\n            return reconstruct_path(came_from, current)\n        \n        for next_node in neighbors(current):\n            new_cost = cost_so_far[current] + cost(current, next_node)\n            \n            if next_node not in cost_so_far or new_cost \u003C cost_so_far[next_node]:\n                cost_so_far[next_node] = new_cost\n                priority = new_cost + heuristic(next_node, goal)\n                heapq.heappush(frontier, (priority, next_node))\n                came_from[next_node] = current\n    \n    return None\n```\n\n### Minimax for Games\n```python\ndef minimax(board, depth, is_maximizing):\n    if is_terminal(board) or depth == 0:\n        return evaluate(board)\n    \n    if is_maximizing:\n        max_eval = -inf\n        for move in get_moves(board):\n            eval = minimax(make_move(board, move), depth - 1, False)\n            max_eval = max(max_eval, eval)\n        return max_eval\n    else:\n        min_eval = inf\n        for move in get_moves(board):\n            eval = minimax(make_move(board, move), depth - 1, True)\n            min_eval = min(min_eval, eval)\n        return min_eval\n\n# Alpha-beta pruning\ndef alphabeta(board, depth, alpha, beta, is_maximizing):\n    if is_terminal(board) or depth == 0:\n        return evaluate(board)\n    \n    if is_maximizing:\n        max_eval = -inf\n        for move in get_moves(board):\n            eval = alphabeta(make_move(board, move), depth - 1, \n                          alpha, beta, False)\n            max_eval = max(max_eval, eval)\n            alpha = max(alpha, eval)\n            if beta \u003C= alpha:\n                break\n        return max_eval\n    else:\n        min_eval = inf\n        for move in get_moves(board):\n            eval = alphabeta(make_move(board, move), depth - 1,\n                          alpha, beta, True)\n            min_eval = min(min_eval, eval)\n            beta = min(beta, eval)\n            if beta \u003C= alpha:\n                break\n        return min_eval\n```\n",{"name":5,"license":14,"metadata":30,"description":7,"compatibility":23},{"audience":31,"category":32},"machine-learning-engineers","artificial-intelligence","main","5f7a3e453c98261f93d19a6a7de44ad8f7b72d41",2,"https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk","2026-03-01 06:55:40",{"source":8,"skillName":5,"commands":40,"prompt":50,"zipAvailable":51},[41,44,47],{"tool":42,"command":43},"npx","npx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill search-algorithms",{"tool":45,"command":46},"bunx","bunx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill search-algorithms",{"tool":48,"command":49},"pnpm","pnpm dlx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill search-algorithms","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fsearch-algorithms\u002FSKILL.md",true,[53,59,63,67,71,75],{"path":54,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":57,"sourceHtmlUrl":58},"eeat-authority.md","REFERENCE","参考文档",4523,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Findranilbanerjee\u002Fdigital-marketing-pro\u002Fskills\u002Fdigital-pr\u002Feeat-authority.md",{"path":60,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":61,"sourceHtmlUrl":62},"link-building-tactics.md",15185,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Findranilbanerjee\u002Fdigital-marketing-pro\u002Fskills\u002Fdigital-pr\u002Flink-building-tactics.md",{"path":64,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":65,"sourceHtmlUrl":66},"media-outreach.md",3797,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Findranilbanerjee\u002Fdigital-marketing-pro\u002Fskills\u002Fdigital-pr\u002Fmedia-outreach.md",{"path":68,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":69,"sourceHtmlUrl":70},"newsjacking.md",3411,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Findranilbanerjee\u002Fdigital-marketing-pro\u002Fskills\u002Fdigital-pr\u002Fnewsjacking.md",{"path":72,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":73,"sourceHtmlUrl":74},"press-releases.md",3346,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Findranilbanerjee\u002Fdigital-marketing-pro\u002Fskills\u002Fdigital-pr\u002Fpress-releases.md",{"path":76,"resourceType":55,"resourceTypeDesc":56,"sizeBytes":77,"sourceHtmlUrl":78},"thought-leadership.md",4037,"https:\u002F\u002Fgithub.com\u002Fhashgraph-online\u002Fawesome-codex-plugins\u002Fblob\u002Fmain\u002Fplugins\u002Findranilbanerjee\u002Fdigital-marketing-pro\u002Fskills\u002Fdigital-pr\u002Fthought-leadership.md",[80,91,101,110,120,129],{"skillNo":81,"name":82,"nameZh":6,"description":83,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":84,"categories":85,"keywords":86,"publishedAt":25},"01M6CXT9TXDF79BWJTMQAPB49G","xamarin","Xamarin cross-platform development","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fxamarin\u002FSKILL.md",[],[82,87,88,89,23,90],"platform","cross-platform","mobile","development",{"skillNo":92,"name":93,"nameZh":6,"description":94,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":95,"categories":96,"keywords":97,"publishedAt":25},"01M6CXT8AD04MFYDA32VW3FKAG","wrangling","Data wrangling fundamentals","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwrangling\u002FSKILL.md",[],[93,98,23,99,100],"data wrangling","science","data",{"skillNo":102,"name":103,"nameZh":6,"description":104,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":105,"categories":106,"keywords":107,"publishedAt":25},"01M6CXT717GCN7SRRNPBDP4508","windows","Windows operating system administration and scripting","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwindows\u002FSKILL.md",[],[103,108,23,109],"system","scripting",{"skillNo":111,"name":112,"nameZh":6,"description":113,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":114,"categories":115,"keywords":116,"publishedAt":25},"01M6CXT54K794NMEM3XAPZZDKT","wide-column","Wide-column data model","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column\u002FSKILL.md",[],[117,118,23,119,100],"wide column","databases","model",{"skillNo":121,"name":122,"nameZh":6,"description":123,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":124,"categories":125,"keywords":126,"publishedAt":25},"01M6CXT28FMT2P4V9GZE67WA8E","wide-column-stores","Wide-column database stores","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column-stores\u002FSKILL.md",[],[127,118,23,128],"wide column stores","database",{"skillNo":130,"name":131,"nameZh":6,"description":132,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":133,"categories":134,"keywords":135,"publishedAt":25},"01M6CXT0D0M0Q4T2N7C2RX7DSN","websockets","WebSocket implementation and best practices","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwebsockets\u002FSKILL.md",[],[131,136,137,138,23,139,140],"websocket","real-time","time","best practices","implementation"]