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 |
|---|---|---|---|
| 57959 | 2019-08-09 22:34:15 | 125.26 | 98% |
| 57139 | 2019-05-01 12:37:26 | 117.92 | 98% |
| 54666 | 2018-07-28 10:51:25 | 127.06 | 97% |
| 54574 | 2018-07-27 14:07:10 | 126.43 | 98% |
| 51979 | 2018-06-04 20:57:33 | 112.95 | 96% |
| 51818 | 2018-06-02 21:52:31 | 119.78 | 98% |
| 48580 | 2017-07-16 17:32:54 | 112.49 | 98% |
| 46985 | 2017-01-17 12:33:32 | 94.37 | 94% |