So A* is the most optimal search algorithm under the specific constraints it specifies. You can't do better. However, sometimes the specific domain you are sea

So A* is the most optimal search algorithm under the specific constraints it specifies. You can't do better. However, sometimes the specific domain you are searching has other constraints that can be exploited to do better than A*. An example of this being Jump Point Search that exploits certain properties of grid searches if you can only move in certain ways. If you were able to write a general searching algorithm that can effectively exploit the whatever the specific properties of the underlying domain "automatically" without you having to actually work out what they are, that would be useful right?