Finishing the Project

[oberhauserg]

Finishing the Project

[oberhauserg]

Here: https://docs.google.com/document/d/1IwEqdHPARllDrFTdoZKSA40cgnlrwVLi-mlc5ORY11I/edit

[oberhauserg]

I looked at that data you uploaded. Some of it doesn't make sense. For example, in test C it says it takes 2 moves to win for greedy bfs. That's impossible.

Also, what do you mean by "Time to Solve"?

[kordusj]

Then there may be an issue with how greedy stores the solution states.

…

On Apr 7, 2017 5:18 PM, "Grant Oberhauser" ***@***.***> wrote: I looked at that data you uploaded. Some of it doesn't make sense. For example, in test C it says it takes 2 moves to win for greedy bfs. That's impossible. Also, what do you mean by "Time to Solve"? — You are receiving this because you were assigned. Reply to this email directly, view it on GitHub <#10 (comment)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AQ7IHTs3uAEzWQVYxW8hYNtS2g88DAbHks5rtrZJgaJpZM4M3afD> .

[tshjones]

Well I got the working beam search, works on the same problem in only 1600 steps. Also gained a loathing for Java which took me three days what I could have done in C++ in hours. Not sure how any of the GUI works though, and I'm almost out of time.

[kordusj]

We have it covered, we couldn't really wait any longer so we had to just modify Astar and implement it.