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 |
|---|---|---|---|
| 53183 | 2020-09-01 04:02:52 | 87.44 | 98% |
| 42544 | 2019-07-27 06:14:52 | 92.58 | 98% |
| 35065 | 2019-01-01 05:35:16 | 94.57 | 99% |
| 32089 | 2018-12-23 14:22:31 | 92.45 | 98% |
| 29256 | 2018-12-15 11:48:35 | 101.63 | 97% |
| 24614 | 2018-11-02 17:08:57 | 101.15 | 97% |
| 24534 | 2018-11-02 16:02:44 | 84.37 | 98% |
| 23167 | 2018-10-20 22:25:54 | 76.48 | 97% |
| 21756 | 2018-10-10 04:20:47 | 72.04 | 97% |
| 20576 | 2018-10-06 04:17:23 | 116.12 | 100% |
| 8429 | 2018-02-16 01:04:57 | 61.74 | 96% |
| 7260 | 2018-01-29 18:36:25 | 59.23 | 96% |
| 6465 | 2018-01-19 19:25:01 | 55.15 | 95% |
| 6339 | 2018-01-19 00:27:55 | 60.10 | 96% |
| 3805 | 2017-12-21 02:25:45 | 52.35 | 95% |
| 2981 | 2017-12-07 21:09:09 | 48.80 | 96% |