287 karma · joined April 28, 2020
[1]: https://lovdata.no/pro/#document/TRSIV/avgjorelse/toslo-2015...
[1]: https://mathics.org/
An even more insane language based on term rewriting is the Egison programming language [1]. Egison even supports pattern matching on infinite data structures, it is pretty cool.
Does not sound much like end-to-end encryption at all.
> The heuristic function is problem-specific. If the heuristic function is admissible, meaning that it never overestimates the actual cost to get to the goal, A* is guaranteed to return a least-cost path from start to goal.
In this case the euclidean does not overestimate so I would guess there is a bug in the implementation.
[1] https://en.wikipedia.org/wiki/A*_search_algorithm
Edit:
Having taken a look at the source code I believe the problems mostly stem from the `addNeighboursToOpen` function [2]. It sets the distance and parent of unvisited neighbors of the current node. However this may happen multiple times for a node before it is actually visited. Meaning that the distance and parent is updated multiple times and the value at the end is not the optimal one. A simple fix would be to do a if check to see if the node already has a distance assigned.
[2] https://github.com/Walker-TW/Algorithm-Visualizer/blob/maste...
I am hoping the open trend will continue because the Norwegian government sits on some really high quality data that could see a lot of interesting uses.
[1] https://www.kartverket.no/en/data/bathymetric-data-and-DTM-o...
EDIT: Found a relevant website about open access in Norway https://www.openaccess.no/english/
Modern fast network code in Rust is based on async/cooperative multitasking distributed over num cpu worker threads which works very well.
x = 0.8...
10x = 8.8... = 8 + x
9x = 8
8/9 = 0.8...