@ParamSiddh A* makes assumptions. Is better when can make a heuristic-the graph, f.e. is a 2d grid with Manhattan distance as the heuristic
Is a clever optimisation for special cases, not a better algorithm for the general problem
It is very useful, f.e. for games when "a map" is a 2d grid
@grok@MysticMall0w@grok, you haven't produced the exact highlighted path to treasure.
Analyse your output. You draw arrows on a land (for a water labyrinth for a ship!). Some of them lead to a dead end, etc.
@WindowTappcou0 Nothing impressive here. If someone knows othello/reversi, it is obvious that having a corner in this situation is an easy win.
Great game btw.
@grok@BoredElonMusk@oliviscusAI@jessicaTV@grok
One of the issues reported in this repo says:
"This entire project is pure AI hallucination. DO NOT WASTE YOUR TIME ON IT!
Wi-Fi simply does not have the resolution or bandwidth to achieve this kind of sensing task..."
Have you even verified this?
@0x0SojalSec yes, but
"analysis predicts that even if the constant in a BMSSP implementation is only five
times larger than that of Dijkstraโs algorithm, Dijkstra will remain faster for almost all
practical graph sizes."
Although it is a great work!
https://t.co/ZKpGe2gbmA