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 |
|---|---|---|---|
| 14073 | 2018-05-08 07:49:48 | 160.38 | 99% |
| 12093 | 2018-03-29 08:29:35 | 169.34 | 100% |
| 11062 | 2018-02-18 15:11:33 | 123.32 | 95% |
| 8587 | 2017-12-07 11:03:35 | 152.23 | 98% |
| 6726 | 2017-11-02 09:18:13 | 148.53 | 99% |
| 4433 | 2017-09-25 10:29:17 | 146.01 | 98% |
| 2731 | 2017-09-09 22:06:47 | 137.83 | 98% |
| 2730 | 2017-09-09 22:05:56 | 120.42 | 97% |
| 691 | 2017-07-10 10:22:35 | 134.29 | 98% |
| 406 | 2017-06-12 09:02:45 | 145.95 | 99% |