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 |
---|---|---|---|
61069 | 2019-12-14 03:07:14 | 114.60 | 97% |
53924 | 2018-06-25 02:53:49 | 146.70 | 99% |
52026 | 2018-05-05 19:25:08 | 146.40 | 98% |
44904 | 2018-01-10 02:16:19 | 133.93 | 98% |
43389 | 2017-12-06 02:06:24 | 135.88 | 99% |
36180 | 2017-06-11 18:29:01 | 127.79 | 98% |
35021 | 2017-05-29 15:28:08 | 123.89 | 98% |