-
AI Path finding algorithms could be improved. AStar is not optimal. It wastes one move. So moving two square distance takes three move even moves should be directly horizontal.
-
Hello CANU team,
Thank you for creating this great assembler and the support you provide to users. I am using CANU v1.7 to assemble a genome ~1Gb in size and with ~100X PacBio raw-reads (~50X from …
-
We have some classes returning List, some returning IEnumerable -- particularly with respect to Coord. These should be unified to likely use IEnumerable whenenver possible.
-
The search notebook currently has a lot of visualizations of graphs and such that are very important to get the concepts across. However, the visualization code itself is not important and the student…
-
Hello,
I'm working on dynamic astar planning and other planning algorithms. Would you be interested in accepting pull requests and possibly collaborating on future project development?
-
It would be nice to have [A*](https://en.wikipedia.org/wiki/A*_search_algorithm) implementation in petgraph library. For path finding and similar stuff.
-
**Operating system or device, Godot version, GPU Model and driver (if graphics related):**
Any OS, current master (2e89dd19)
**Issue description:**
Doctool outputs a wrong formatting for multilin…
-
#### Current Behaviour
```
Error 1:
Type: Architecture file
File: /home/tansell/work/catx/vtr-verilog-to-routing/vpr/src/route/rr_graph.cpp
Line: 701
Message: No switch is specified for the ipi…
-
LeoQC updated
6 years ago
-
I see the [astar] package has both a standard and monadic version of the astar function. Is it likely you might add similar functions to `search-algorithms`? (I do like your approach of factoring out …