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 |
|---|---|---|---|
| 32380 | 2018-05-13 11:23:06 | 105.75 | 99% |
| 31756 | 2018-03-18 21:44:20 | 118.55 | 100% |
| 28296 | 2017-10-05 18:24:30 | 101.90 | 99% |
| 25820 | 2017-05-29 23:04:11 | 95.16 | 93% |
| 25424 | 2017-05-11 15:13:12 | 105.34 | 96% |
| 22597 | 2017-01-24 08:59:58 | 97.30 | 99% |