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 |
|---|---|---|---|
| 6319 | 2017-03-18 23:20:22 | 123.20 | 97% |
| 5954 | 2017-03-11 00:27:10 | 115.86 | 94% |
| 5114 | 2017-02-16 20:08:16 | 121.51 | 96% |
| 4869 | 2017-02-12 17:43:08 | 130.33 | 99% |
| 4822 | 2017-02-08 19:14:12 | 105.29 | 94% |
| 4561 | 2017-02-03 19:37:47 | 125.80 | 98% |
| 3764 | 2017-01-16 20:15:05 | 104.09 | 97% |
| 3665 | 2017-01-15 23:45:50 | 116.90 | 98% |