awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

5 个仓库

Awesome GitHub RepositoriesGrid Pathfinding

Algorithms for calculating optimal or total paths within a grid-based coordinate system.

Distinct from Game World Pathfinding: Focuses on algorithmic path counting and optimization in grids rather than high-level game world navigation frameworks

Explore 5 awesome GitHub repositories matching artificial intelligence & ml · Grid Pathfinding. Refine with filters or upvote what's useful.

Awesome Grid Pathfinding GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • azl397985856/leetcodeazl397985856 的头像

    azl397985856/leetcode

    55,758在 GitHub 上查看↗

    This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

    The project calculates the total number of unique paths in a grid using dynamic programming or memoized recursion.

    JavaScriptalgoalgorithmalgorithms
    在 GitHub 上查看↗55,758
  • qiao/pathfinding.jsqiao 的头像

    qiao/PathFinding.js

    8,701在 GitHub 上查看↗

    PathFinding.js is a grid-based pathfinding library that implements multiple search algorithms for computing optimal routes on 2D maps. It provides implementations of A*, Dijkstra, Breadth-First Search, and Jump Point Search, each designed to find the shortest path between two points on a grid while avoiding obstacles. The library is built around a pluggable architecture where each pathfinding strategy shares a common interface, allowing algorithms to be selected at runtime without modifying core logic. It includes a configurable diagonal movement rule engine that controls diagonal traversal b

    A library that computes shortest routes on 2D grids using multiple search algorithms like A* and Dijkstra.

    JavaScript
    在 GitHub 上查看↗8,701
  • electronicarts/cnc_generals_zero_hourelectronicarts 的头像

    electronicarts/CnC_Generals_Zero_Hour

    4,619在 GitHub 上查看↗

    本项目是一个专注于现代战争的实时战略游戏和军事战斗模拟器。它提供了一个模拟环境,玩家可以在其中建立基地并指挥军事单位,以实现战术目标并在全球各地执行战斗行动。 该软件作为一个用户生成内容平台,具有用于创建、上传和共享自定义地图的社区创意工坊。它还包括一个由叙事驱动的单人战役,由一系列战略任务组成。 游戏玩法涉及与利用不同战术个性的计算机控制指挥官进行战斗。该模拟涵盖了军队构成、战略升级和 AI 战斗模拟。

    Implements grid-based pathfinding algorithms to calculate navigation routes and enforce building placement constraints.

    C++command-and-conqueropen-sourcereal-time-strategy
    在 GitHub 上查看↗4,619
  • killedbyapixel/littlejsKilledByAPixel 的头像

    KilledByAPixel/LittleJS

    4,127在 GitHub 上查看↗

    LittleJS 是一个轻量级的 HTML5 2D 游戏引擎,专为使用 Canvas 和 WebGL 构建 Web 游戏而设计,无需外部依赖。它集成了 WebGL 精灵渲染器、用于街机风格碰撞和刚体动力学的 2D 物理引擎,以及用于实体导航的基于网格的 A* 寻路系统。 该引擎的独特之处在于其程序化音频合成器,它使用参数数组在运行时生成音乐和音效,从而最大限度地减小文件大小。它还具有全面的图形流水线,支持自定义片元着色器后处理和动态 2D 光照系统。 该框架涵盖了广泛的开发功能,包括粒子效果生成、基于帧的精灵动画以及带有离屏 Canvas 缓存的瓦片地图渲染。它为键盘、鼠标和游戏手柄信号提供了统一的输入管理,以及通过本地存储进行游戏状态持久化和成就跟踪的实用程序。 该项目包括用于从 JSON 格式文件加载关卡数据的工具,并提供用于监控内部引擎状态的可视化调试覆盖层。

    Computes the shortest route between two points on a grid using A* pathfinding with smoothing.

    JavaScriptbox2dgame-developmentgame-engine
    在 GitHub 上查看↗4,127
  • space-wizards/space-station-14space-wizards 的头像

    space-wizards/space-station-14

    3,523在 GitHub 上查看↗

    Space Station 14 is a C# multiplayer game and roleplay simulation framework. It is built upon an Entity-Component-System (ECS) game engine that separates logic into systems and data into components to manage complex entity interactions. The project functions as a grid-based physics simulator with a YAML data-driven prototype system for defining game objects. The project features a specialized 2D sprite rendering engine that maps server-side appearance data to client-side shaders. It implements a networking model with client-side prediction and dirty-flagged state synchronization to reduce inp

    Utilizes A* and Breadth-First Search algorithms to determine optimal routes across grid-based game world graphs.

    C#c-sharpgamehacktoberfest
    在 GitHub 上查看↗3,523
  1. Home
  2. Artificial Intelligence & ML
  3. Machine Learning
  4. Frameworks
  5. Reinforcement Learning Environments
  6. Grid World Simulation Frameworks
  7. Game World Pathfinding
  8. Grid Pathfinding

探索子标签

  • Grid CloningDuplicating a grid instance so the original remains unmodified after a pathfinding operation. **Distinct from Grid Pathfinding:** Distinct from Grid Pathfinding: focuses on preserving the original grid state by cloning, not the pathfinding algorithm itself.
  • Jump Point Search PathfindingA pathfinding algorithm that accelerates A* on uniform-cost grids by skipping large open areas. **Distinct from Grid Pathfinding:** Distinct from Grid Pathfinding: Jump Point Search is a specific optimization for uniform-cost grids, not a general grid pathfinding algorithm.
  • Obstacle DefinitionsMarking individual cells or entire matrices as blocked or walkable to define navigable space. **Distinct from Grid Pathfinding:** Distinct from Grid Pathfinding: focuses on defining which cells are obstacles, not the pathfinding algorithm itself.