PathFinding.js VS awesome-advent-of-code

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/

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/

"A* Pathfinding Visualization" demo on GitHub by Qiao Zhang: https://qiao.github.io/PathFinding.js/visual/

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.

Here it is visualised https://qiao.github.io/PathFinding.js/visual/

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/

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/

Here's a picture comparing the search areas using this tool that another commenter linked.

Also worth checking out this repo for solutions in any language: https://github.com/Bogdanp/awesome-advent-of-code

This is a good idea, but we already have (at least 1) established list that people are using: https://github.com/Bogdanp/awesome-advent-of-code

What was the most eloquent solution I found on Github and Youtube?

https://github.com/Bogdanp/awesome-advent-of-code Check out this repo for solutions for various languages. Consider adding yours to the C# part of the README

```

I find the above really elegant. It's correct, the special case for "0" is very explicit, and if you try a negative number, Elixir will simply be unable to match the given problem to a function definition (n < 0), which makes more sense than throwing "BadArgument" errors/exceptions.

If you really want to just solve problems, I advise sticking with Python, there's nothing wrong with it. Most languages also provide a lot of functional concepts, I'm sure Python is no exception (with some libraries). Be prepared that functional languages require you to think differently, but it is really fun to do things in a functional way!

Good luck!

[1]: https://github.com/Bogdanp/awesome-advent-of-code

I added my repo to Awesome AoC because the other two Dart solutions were not for all days. I'm not sure my code is the best example of Dart code! Is your code available? Maybe you could share it?