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 |
|---|---|---|---|
| 52436 | 2020-05-09 15:08:06 | 140.00 | 99% |
| 47788 | 2020-04-08 23:13:00 | 144.35 | 98% |
| 46899 | 2020-04-04 19:12:05 | 129.03 | 96% |
| 44192 | 2020-03-23 17:13:35 | 166.99 | 99% |
| 40078 | 2020-03-08 16:19:04 | 149.12 | 98% |
| 35469 | 2020-01-19 22:02:35 | 144.19 | 98% |
| 32991 | 2019-09-24 19:53:03 | 164.07 | 99% |
| 32761 | 2019-09-21 14:49:15 | 154.09 | 100% |
| 31204 | 2019-08-30 19:42:29 | 153.03 | 99% |
| 25118 | 2019-07-22 13:31:28 | 139.56 | 98% |
| 10099 | 2018-06-01 15:00:40 | 125.33 | 97% |
| 5187 | 2018-04-17 19:55:36 | 163.32 | 100% |
| 5128 | 2018-04-17 11:48:33 | 146.70 | 97% |
| 2550 | 2018-03-25 18:16:51 | 149.34 | 98% |
| 1853 | 2018-03-19 22:06:51 | 138.84 | 97% |