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/leetcode
azl397985856/leetcode
55,758GitHub पर देखें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 - qiao/pathfinding.js
qiao/PathFinding.js
8,701GitHub पर देखें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 - electronicarts/cnc_generals_zero_hour
electronicarts/CnC_Generals_Zero_Hour
4,619GitHub पर देखेंयह प्रोजेक्ट एक रीयल-टाइम स्ट्रैटेजी गेम और मिलिट्री कॉम्बैट सिम्युलेटर है जो आधुनिक युद्ध पर केंद्रित है। यह एक सिमुलेशन प्रदान करता है जहाँ खिलाड़ी सामरिक उद्देश्यों को प्राप्त करने और विभिन्न वैश्विक स्थानों पर युद्ध अभियानों को निष्पादित करने के लिए बेस बनाते हैं और सैन्य इकाइयों को कमांड करते हैं। यह सॉफ़्टवेयर एक यूज़र-जनरेटेड कंटेंट प्लेटफॉर्म के रूप में कार्य करता है, जिसमें कस्टम मैप्स बनाने, अपलोड करने और साझा करने के लिए एक कम्युनिटी वर्कशॉप शामिल है। इसमें रणनीतिक मिशनों की एक श्रृंखला से बना एक नैरेटिव-ड्रिवन सिंगल-प्लेयर अभियान भी शामिल है। गेमप्ले में कंप्यूटर-नियंत्रित कमांडरों के साथ लड़ाई शामिल है जो विशिष्ट सामरिक व्यक्तित्वों का उपयोग करते हैं। सिमुलेशन में सेना संरचना, रणनीतिक अपग्रेड, और AI कॉम्बैट सिमुलेशन शामिल हैं।
Implements grid-based pathfinding algorithms to calculate navigation routes and enforce building placement constraints.
C++command-and-conqueropen-sourcereal-time-strategy - killedbyapixel/littlejs
KilledByAPixel/LittleJS
4,127GitHub पर देखेंLittleJS is a lightweight HTML5 2D game engine designed for building web games using Canvas and WebGL without external dependencies. It integrates a WebGL sprite renderer, a 2D physics engine for arcade-style collisions and rigid-body dynamics, and a grid-based A* pathfinding system for entity navigation. The engine is distinguished by its procedural audio synthesizer, which generates music and sound effects at runtime using parameter arrays to minimize file sizes. It also features a comprehensive graphics pipeline that supports custom fragment-shader post-processing and a dynamic 2D lighting
Computes the shortest route between two points on a grid using A* pathfinding with smoothing.
JavaScriptbox2dgame-developmentgame-engine - space-wizards/space-station-14
space-wizards/space-station-14
3,523GitHub पर देखें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
