Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

TP1 - Q3 - h not so admissible? #8

Open
loupwolf opened this issue May 21, 2024 · 1 comment
Open

TP1 - Q3 - h not so admissible? #8

loupwolf opened this issue May 21, 2024 · 1 comment

Comments

@loupwolf
Copy link

Hi, it seems to me that, in the TP1, the "h" function of the Q3 is not admissible because it overestimates the remaining distance from B to G2. The A* algorithm can't find the shortest path "('SBEG2', 13)". Instead it converges towards "('SACDG1', 14)".
bugTAI

Best regards,
Loup

@KenN7
Copy link
Member

KenN7 commented May 21, 2024

Hi :)
Yes indeed, h is not admissible in this case, the exercise does not make any assumptions on this.
In this case, A* does not find an optimal solution, congrats on finding the trick ;)
I agree this could be more clear in the exercise, either by adding a disclaimer on the possible "non-admissibility" of h, or by making h admissible by e.g. changing the B-1->E to a B-3->E

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants