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 |
|---|---|---|---|
| 12043 | 2018-04-13 01:27:24 | 147.88 | 98% |
| 10343 | 2018-02-14 23:29:48 | 165.87 | 99% |
| 5538 | 2017-10-07 21:42:34 | 139.76 | 99% |
| 1481 | 2017-06-09 23:46:05 | 103.70 | 97% |
| 975 | 2017-05-06 01:33:13 | 103.93 | 86% |