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 |
|---|---|---|---|
| 9478 | 2019-03-14 20:12:20 | 90.69 | 97% |
| 8876 | 2018-11-29 20:33:05 | 93.91 | 97% |
| 7699 | 2018-09-12 13:34:07 | 103.49 | 97% |
| 6674 | 2018-07-13 15:04:51 | 103.82 | 99% |
| 6522 | 2018-07-04 15:21:59 | 94.32 | 97% |
| 6411 | 2018-06-13 18:11:43 | 89.50 | 96% |
| 5981 | 2018-04-03 07:07:34 | 94.42 | 98% |