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 |
---|---|---|---|
1399 | 2017-07-29 08:11:19 | 38.82 | 95% |
1005 | 2017-06-17 06:14:57 | 36.65 | 96% |
932 | 2017-06-02 19:46:33 | 42.04 | 92% |
770 | 2017-05-16 07:08:35 | 37.43 | 89% |