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 |
|---|---|---|---|
| 17098 | 2017-08-04 20:34:33 | 188.90 | 98% |
| 17084 | 2017-08-04 20:24:37 | 191.54 | 99% |
| 14870 | 2017-05-19 21:07:32 | 186.93 | 95% |
| 14844 | 2017-05-11 22:28:08 | 197.47 | 100% |
| 14594 | 2017-04-30 19:53:08 | 172.43 | 95% |
| 13225 | 2017-03-06 02:54:52 | 167.98 | 94% |