add a shortest path challenge #608
Draft
Conversation
This file contains 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
|
@byorgey do you want to try BFS solution with infinite items? 🙂 |
|
Nice, that should simplify things a good deal. I will try to get back to this at some point soon. |
Still not sure of best way to make it work!
We really do need a queue of locations. We could create one now via `list.sw` --- i.e. Gödel-encode each coordinate pair as an int, then make a banker's queue with two lists of ints, themselves Gödel-encoded as lists. That sounds super tedious though, might be better to wait until we have real recursive types. Even with queues, getting from one location in the queue to the next is tricky. Have to also store the BFS tree and use it to navigate from one to the next??
Iterative deepening DOES work, I was confused =P
Doesn't seem to work yet.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
No solution yet... checking the solution will also be somewhat nontrivial. I'm thinking that if we precompute the length of a shortest path, then we can write code to follow a marked path, make sure it doesn't branch, leads to the goal, and has the correct length.