5.2. Best-First Search

Best-First Search is a type of scan that:
1. Gives priority to each state based on some weight function.
2. Determines which state to go to next, according to their highest priority.
I implemented Best-First Search whose weight function was a linear combination of several weighting functions I thought about.
It turned out that for most boards, I could find some relative weights that could solve it very quickly, but no configuration was good for any board.