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 |
|---|---|---|---|
| 7990 | 2017-06-29 17:42:39 | 77.05 | 97% |
| 7977 | 2017-06-29 16:28:03 | 68.93 | 98% |
| 6734 | 2017-06-08 20:26:02 | 60.44 | 95% |
| 6255 | 2017-06-02 22:58:49 | 62.16 | 89% |
| 5165 | 2017-05-15 20:53:36 | 60.16 | 92% |
| 4913 | 2017-05-08 22:40:47 | 49.46 | 91% |
| 4763 | 2017-05-05 19:44:41 | 66.42 | 96% |
| 963 | 2017-03-10 19:42:32 | 48.42 | 84% |