To move through a tree of paths using hill climbing, proceed as in depth-first search, but order the choices according to some heuristic measure of remaining distance. The better the heuristic measure is, the better hill climbing will be relative to ordinary depth-first search.
Game | Time | WPM | Accuracy |
---|---|---|---|
843 | 2020-02-04 09:00:07 | 90.77 | 98% |
579 | 2019-06-09 10:45:47 | 82.44 | 97% |