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 |
|---|---|---|---|
| 8935 | 2018-09-19 05:16:41 | 85.79 | 98% |
| 6170 | 2018-06-22 05:50:15 | 93.10 | 98% |
| 3448 | 2018-05-11 07:14:02 | 77.33 | 97% |
| 2119 | 2018-03-25 02:33:59 | 82.73 | 98% |