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 |
|---|---|---|---|
| 18074 | 2019-11-13 11:36:55 | 98.75 | 100% |
| 15229 | 2019-02-06 12:23:38 | 81.84 | 99% |
| 13426 | 2018-09-09 03:54:31 | 77.67 | 98% |
| 13226 | 2018-09-04 14:18:54 | 75.54 | 98% |
| 12452 | 2018-08-15 03:55:29 | 73.96 | 98% |
| 8046 | 2018-02-08 08:13:21 | 64.49 | 96% |
| 6992 | 2017-12-10 12:21:41 | 66.67 | 97% |
| 5630 | 2017-10-18 06:29:40 | 64.28 | 96% |
| 4996 | 2017-09-19 03:16:44 | 62.91 | 97% |
| 2080 | 2017-08-01 09:55:03 | 54.30 | 95% |
| 1877 | 2017-07-31 04:16:20 | 58.12 | 97% |
| 1862 | 2017-07-30 17:01:03 | 53.88 | 97% |
| 865 | 2017-07-23 10:45:30 | 57.72 | 97% |