3 ms·
I disagree with your definition of "well". It found an optimal solution only 30% (roughly inferred from the bar plot) of the time and only on graphs of very lim
by Fragoel2 4y ago
I disagree with your definition of "well". It found an optimal solution only 30% (roughly inferred from the bar plot) of the time and only on graphs of very limited size (up to 14 nodes). I'm pretty sure even the most basic path-finding algorithms we have can do better than this.
- ALittleLight 4y agoIt's not about competing with good path finding algorithms. It would not be surprising to find a program that someone had written to find paths that could kind of find paths okay. The surprising thing is that nobody wrote this program to find paths at all. This is a program that is attempting to predict what the next characters are in a string of text - and it can kind of do path finding.
- amelius 4y agoHow well does GPT-3 perform on standard IQ tests?