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 |
|---|---|---|---|
| 2010 | 2017-11-03 00:19:14 | 70.02 | 99% |
| 1318 | 2017-06-03 23:44:44 | 75.93 | 92% |
| 1294 | 2017-05-28 16:59:40 | 56.01 | 92% |
| 363 | 2017-01-24 17:12:27 | 73.65 | 97% |