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 |
|---|---|---|---|
| 46342 | 2019-12-19 07:04:36 | 152.82 | 99% |
| 44910 | 2019-11-21 03:55:35 | 160.42 | 100% |
| 33972 | 2019-05-05 07:26:57 | 107.71 | 98% |
| 27692 | 2018-05-26 20:46:16 | 116.08 | 98% |
| 27379 | 2018-05-23 04:13:31 | 141.09 | 99% |
| 25574 | 2018-02-28 03:51:21 | 110.28 | 99% |
| 23317 | 2017-08-06 09:01:59 | 117.45 | 99% |
| 18406 | 2017-05-01 18:06:06 | 129.95 | 98% |
| 14762 | 2017-02-27 08:42:21 | 91.96 | 89% |
| 13768 | 2017-02-18 21:03:59 | 108.55 | 96% |
| 11517 | 2017-01-29 00:24:09 | 112.10 | 98% |