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 |
|---|---|---|---|
| 6445 | 2020-10-22 12:24:22 | 80.57 | 95% |
| 2946 | 2017-11-03 12:30:10 | 57.31 | 93% |
| 2252 | 2017-09-08 11:48:17 | 53.60 | 92% |
| 1836 | 2017-08-27 13:47:37 | 46.09 | 91% |
| 670 | 2017-05-21 02:09:16 | 51.77 | 92% |
| 612 | 2017-05-15 15:26:58 | 44.35 | 89% |