-
Notifications
You must be signed in to change notification settings - Fork 411
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
4th Edition Algorithm: Bidirectional Search #41
Comments
This was referenced Mar 31, 2017
I am a bit confused on how to work with this repository. Should we wait for the AIMA pseudocode, or can we implement the algorithm with the given pseudocode in the link, and then adjust the code to the AIMA pseudocode when it comes? |
I am going to implement the algorithm from the paper linked above. When we have aima pseudocode, I think it will be easier to convert than writing it from scratch. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
I will be introducing new algorithms for the fourth edition here, in aima-pseudocode, and they can then be moved over to aima-java, aima-python, etc. as people pick them up.
We will add an algorithm for bidirectional search that is guaranteed to meet in the middle, from this paper: https://webdocs.cs.ualberta.ca/~holte/Publications/MM-AAAI2016.pdf
I haven't re-written the pseudocode algorithm from that paper in the form that is consistent with the rest of the search algorithms; that should come.
The text was updated successfully, but these errors were encountered: