As long as you need to always find the path when there is one, A* will look at every square before failing. However, if you can accept it failing to find some paths, you can put limits to path length, eg. based on the direct distance between two squares.