[WIP] ENH: add support for all types of problems in Bidirectional Search #1147
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Collaborator
|
dj5x5
pushed a commit
to dj5x5/aima-python
that referenced
this pull request
Jul 17, 2025
…rch (aimacode#1147) * ENH: all problems can now use BS * TST: add test for all types of problems for BS
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Fixes #1144
I have added support for all types of problems in Bidirectional Search and their tests.
I am still confused about two things:
Uvalue in BS? Maybe, we can also add that like all other search algorithms.e(minimum edge value) value which can take exponential time for large problems. So, is it fine to initialize it to 0 or there is a way to calculate it?