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 |
|---|---|---|---|
| 12697 | 2018-07-29 18:47:34 | 140.09 | 97% |
| 9253 | 2017-11-18 15:38:54 | 112.54 | 98% |
| 8450 | 2017-11-15 18:17:13 | 142.69 | 98% |
| 7950 | 2017-11-07 00:38:00 | 145.81 | 98% |
| 4712 | 2017-10-22 09:49:36 | 138.79 | 99% |
| 3367 | 2017-10-13 04:09:46 | 139.84 | 99% |
| 3065 | 2017-10-11 23:03:02 | 144.76 | 100% |
| 1708 | 2017-07-19 21:15:21 | 125.85 | 97% |