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 |
|---|---|---|---|
| 66648 | 2020-04-21 04:09:49 | 170.05 | 100% |
| 66261 | 2020-04-09 04:52:47 | 156.69 | 99% |
| 53192 | 2019-03-19 03:45:48 | 187.17 | 100% |
| 50040 | 2019-01-30 17:37:20 | 172.92 | 99% |
| 44509 | 2018-12-10 05:22:49 | 160.21 | 99% |
| 41318 | 2018-10-22 15:55:01 | 172.16 | 100% |
| 40691 | 2018-10-17 05:01:58 | 163.93 | 100% |
| 40415 | 2018-10-14 20:45:44 | 161.66 | 99% |
| 38497 | 2018-09-29 13:12:37 | 151.37 | 99% |
| 27621 | 2018-03-23 16:21:36 | 156.55 | 100% |
| 26664 | 2018-01-19 15:56:55 | 161.62 | 100% |
| 25912 | 2018-01-08 05:42:31 | 152.75 | 99% |
| 23401 | 2017-10-26 15:57:27 | 162.87 | 100% |
| 21017 | 2017-07-20 13:42:04 | 161.34 | 100% |
| 20231 | 2017-04-20 16:21:04 | 158.50 | 100% |
| 20027 | 2017-03-11 15:51:58 | 125.45 | 91% |