Finish A*/Greedy - Githubissues

lrbridge commented 9 years ago

I wrote test cases to expose the remaining TODOs in A* and Greedy. I'm in the process of fixing but haven't quite gotten it done yet.

if we come across the same state again, replace node in frontier with lower cost node
make tiebreakers better for A* (use greedy, than closer x, than closer y, than up/down/left/right convention?)

lrbridge commented 9 years ago

Just FYI for @ckwacker & @GoingToRock... fixing these last few things & testing for part 1. Just wanted to update you guys on where I'm at.

lrbridge commented 9 years ago

Thanks for the help @ckwacker, I was not using the path cost for replacing the node on the frontier (I was using the expected cost to go).

There is 1 remaining test failing for Greedy because it seems like it's not behaving how I would expect... any thoughts?

Now that I thought about it more I guess it makes sense... once we've expanded a node we never go back and update its' parent pointer so they trace back the long route. I'll make it pass because it makes sense to me now. Take a look at it though and see if you agree - GreedyBestFirstSearchTest greedyVsAStar2

lrbridge / mango

Finish A*/Greedy #1