# my A* path: searching too much?

This topic is 4730 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

## Recommended Posts

#############
#           #
#     #     #
#     #     #
#     #     #
# :   #   : #
#  :  #  :  #
#   : # :   #
#    :#:    #
#     :     #
#           #
#############
#############
#     @     #
#   @@#@    #
# @@@@# @   #
#@@@@@#     #
#@@@@@#   : #
#@@@@@#  :  #
# @@@@# @   #
#   @@#@    #
#     @     #
#           #
#############
[Sneftel gave me the humiliatingly obvious answer] The top shows the path taken, the bottom shows that same path with the closed nodes. Is it normal for the path to give up when it gets so close at the top and then go through the other way? My heuristic method works by finding the abolute shortest possible path (as if there were no obstacles). I do not use the "Manhattan method". Is this normal behavior? If I move the starting location down 1 space, then it looks just fine:
#############
#           #
#     #     #
#     #     #
#     #     #
#     #   : #
# ::  #  :  #
#   : # :   #
#    :#:    #
#     :     #
#           #
#############
#############
#           #
#     #     #
#   @@#     #
# @@@@#     #
#@@@@@#   : #
#@@@@@#  :  #
# @@@@# @   #
#  @@@#@    #
#     @     #
#           #
#############

##### Share on other sites
It doesn't "give up" and go the other way; it's trying both ways at the same time, and one of them wins out over the other.

##### Share on other sites
Quote:
 Original post by SneftelIt doesn't "give up" and go the other way; it's trying both ways at the same time, and one of them wins out over the other.

Do I feel like an idiot or what... [depressed]

• 10
• 17
• 9
• 13
• 41