Best-first search


## BeFS
Best-first search is a graph search which orders all partial solutions
### Best-first searches
|Title|
|:-:|
|[Beam search](https://texonom.com/beam-search-1d4849a166a14f33beb8d092e0977a03)|
|[Greedy BeFS](https://texonom.com/greedy-befs-2297a39a44c643dab8cdb36335c9dbd1)|



> [Best-first search](https://en.wikipedia.org/wiki/Best-first_search)





