Hey @MrDupin , @norvig . I found that I actually implemented greedy best first search algo in my PR #708. So I want to make changes and make it greedy best first search algo and as all the uniform cost search, greedy best first search, a* algos use best first search algo, I would like to remove the repetition of best first algo in the search.ipynb (repeated thrice).
I would also like to add some short documentation explaining the differences between them so that these algorithms will be easily understandable for others. Is it advisable to continue?
Thanks.