PathFinding.js
build-your-own-x
PathFinding.js | build-your-own-x | |
---|---|---|
14 | 254 | |
8,301 | 257,792 | |
- | 2.3% | |
0.0 | 6.5 | |
10 months ago | 6 days ago | |
JavaScript | ||
- | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
PathFinding.js
-
A* Tricks for Videogame Path Finding
JPS is fun; though I struggled to interpret the suggested performance gains by the authors indeed due to the calculation of the jump nodes.
Many years ago I added a visualisation to the JPS implementation of PathFinding.js to visualise this recursive search to find jump nodes - here's an online demo: https://qiao.github.io/PathFinding.js/visual/
-
Why do pawns walk crooked like this?
Would be very, very weird. This just seems like the heuristics bugging out. I just replicated the terrain from this screenshot on: https://qiao.github.io/PathFinding.js/visual/
-
Show HN: GPT-4-powered web searches for developers on Phind.com
"A* Pathfinding Visualization" demo on GitHub by Qiao Zhang: https://qiao.github.io/PathFinding.js/visual/
-
bif fort 100 fps 200 dwarfs 4x4 embark.
Central staircase is a bad idea for pathfinding. See e.g. here, try it in 2D here. If you want fps for 200 dwarfs keep things on one z-level with rooms along a single corridor. I personally don't like all these low z-level forts so use multiple staircases at the edges of a cube.
- Graph pathfinding video
-
Is A* pathfinding hard for beginners to code?
Here it is visualised https://qiao.github.io/PathFinding.js/visual/
-
Can you find the optimal route for the trolly?
Jokes aside, I started this year and solved a couple of problems like this. I really liked the challenged, discovered and read about something called graphs in mathematics and Hamiltonian paths. There is a simple part and an algorithm part. The simple part is "listing" all the dots there. Imagine a table of elements, every dot has its sub- table with its name and connections (where you have a list of all the other Dots you could directly go from this one). Then comes the algorithm, which can be as elaborate as you want. Usually, if you don't mind performance time, it becomes simple since you only need to tell the program "start here, end here, go through all possible paths and give me the shortest one" Then, if you need to have a better performance, you adapt one of the many know algorithms for pathfinding, like the dikjistra one. For those, when adapted into your code, you "just" give them your table of dots with their connections and they will return you the "shortest" path, or the first they found, depending on the algorithm. The challenge I found most useful to understand this was from codewars. https://www.codewars.com/kata/5a667236145c462103000091 And here you can se a demonstration of those algorithms (just imagine that every square, in this case, would be one of those dots and instead of 4 connections they have the ones showed here) https://qiao.github.io/PathFinding.js/visual/
- [Media] Wrote a neat little maze solver. Largest solved so far is 125k x 125k. Here's a smaller 512x512:
-
Beginner C++ Projects Recommendation?
make this (but as a desktop application, not a web app - you can make it a lot simpler and just implement A Star) https://qiao.github.io/PathFinding.js/visual/
-
Is it normal if A* does this?
Here's a picture comparing the search areas using this tool that another commenter linked.
build-your-own-x
-
How to Become a Software Engineer ?
View on GitHub
- Build Your Own X
-
10 GitHub repositories that every developer must follow
✅ codecrafters-io/build-your-own-x : https://github.com/codecrafters-io/build-your-own-x
- 18 Must-Bookmark GitHub Repositories Every Developer Should Know
-
Top 10 GitHub Repositories Every Developer Should Bookmark in 2024
8) Build Your Own X: Unleash your inner inventor and embark on a journey of self-creation with this collection of project ideas for building your own software, tools, and even operating systems. Fuel your entrepreneurial spirit and learn valuable engineering principles by bringing your innovative ideas to life. (https://github.com/codecrafters-io/build-your-own-x)
-
Crafting Interpreters
Also if we can someone merge this level of detail/guidance with the projects on https://codecrafters.io/, i would easily pay for something like that.
-
Resources I wish I knew when I started my career
Build your own X is another useful resource for a curious mind.
-
I want some fun things to code with python
This is what you're looking for: Build your own X!
- What now?
- GitHub - codecrafters-io/build-your-own-x: Master programming by recreating your favorite technologies from scratch.
What are some alternatives?
pysc2 - StarCraft II Learning Environment
project-based-learning - Curated list of project-based tutorials
awesome-advent-of-code - A collection of awesome resources related to the yearly Advent of Code challenge.
chibicc - A small C compiler
gerev - 🧠 AI-powered enterprise search engine 🔎
languages - Powers multi-language support for CodeCrafters challenges
Daily-Coding-DS-ALGO-Practice - A open source project🚀 for bringing all interview💥💥 and competative📘 programming💥💥 question under one repo📐📐
computer-science - :mortar_board: Path to a free self-taught education in Computer Science!
every-programmer-should-know - A collection of (mostly) technical things every software developer should know about
forward-proxy - Minimal HTTP(S) forward proxy using 150LOC and only standard libraries.
system-design-primer - Learn how to design large-scale systems. Prep for the system design interview. Includes Anki flashcards.
honggfuzz - Security oriented software fuzzer. Supports evolutionary, feedback-driven fuzzing based on code coverage (SW and HW based)