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 |
|---|---|---|---|
| 25447 | 2019-08-05 23:13:20 | 117.16 | 98% |
| 24928 | 2019-06-05 18:42:50 | 113.46 | 97% |
| 18313 | 2018-07-18 17:15:19 | 119.18 | 97% |
| 9162 | 2017-10-26 16:08:21 | 106.28 | 97% |
| 8296 | 2017-10-12 22:32:30 | 101.14 | 97% |
| 5862 | 2017-08-24 16:37:09 | 103.24 | 98% |
| 4869 | 2017-08-03 20:13:45 | 110.76 | 97% |
| 3745 | 2017-07-18 22:08:39 | 93.33 | 97% |
| 2102 | 2017-06-06 16:59:41 | 89.44 | 96% |