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 |
|---|---|---|---|
| 7046 | 2020-03-22 22:31:12 | 100.34 | 98% |
| 4187 | 2018-06-02 00:53:52 | 109.17 | 100% |
| 2734 | 2017-09-09 04:27:28 | 96.69 | 98% |
| 1932 | 2017-07-06 06:34:48 | 85.27 | 99% |
| 1841 | 2017-07-05 23:17:20 | 84.01 | 96% |
| 1310 | 2017-06-19 01:35:18 | 86.76 | 97% |