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 |
|---|---|---|---|
| 65136 | 2020-08-22 21:39:49 | 106.89 | 99% |
| 60668 | 2020-01-08 21:38:08 | 103.50 | 97% |
| 47422 | 2019-03-29 23:42:22 | 103.87 | 98% |
| 45351 | 2019-02-27 00:57:25 | 85.57 | 96% |
| 44176 | 2019-02-06 21:19:29 | 105.47 | 98% |
| 39857 | 2018-12-05 00:58:37 | 98.11 | 96% |
| 33397 | 2018-09-25 01:06:52 | 98.87 | 97% |
| 31719 | 2018-09-08 18:24:35 | 109.09 | 98% |
| 20477 | 2018-03-27 02:00:44 | 99.21 | 99% |
| 18100 | 2018-02-27 01:51:26 | 103.17 | 98% |
| 16724 | 2018-02-09 00:43:29 | 92.12 | 96% |
| 8116 | 2017-07-19 21:05:17 | 91.79 | 96% |
| 7751 | 2017-07-08 02:18:57 | 89.63 | 97% |
| 3395 | 2017-04-17 22:24:05 | 100.04 | 95% |
| 2806 | 2017-04-10 20:46:21 | 85.83 | 90% |
| 2079 | 2017-03-31 21:13:42 | 83.59 | 95% |
| 1098 | 2017-03-24 01:05:04 | 76.39 | 92% |