Show HN: GPT-4-powered web searches for developers
I asked it this question[1],    I traverse a maze using a basic A* implementation (using the Manhattan distance metric). However, after the traversal, I would like to find out what wall would give me the best alternative path. Apart from removing every block and re-running A* on the maze, what's a more clever and elegant solution?

a question I asked on SO over 10 years ago. The SO thread includes working code and very friendly explanations and discussion. The answer Phind gives is the following[2]. It tells me to use D＊-lite (complete overkill), Theta＊ (totally wrong), or "Adaptive-A＊" (not sure if that's an actual thing, all I can find is a random paper).I was working on this in the context of a game I was making at the time, and while this is certainly a hard (and maybe rare) question, it's still on the level of CS undergrad.[1] https://stackoverflow.com/questions/2489672/removing-the-obs...[2] https://www.phind.com/search?cache=d08cd0e7-4aa8-4d75-b1cd-7...