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 |
---|---|---|---|
29686 | 2019-03-19 07:47:18 | 91.93 | 97% |
13509 | 2017-11-01 06:43:43 | 78.00 | 95% |
13195 | 2017-10-31 22:21:46 | 77.48 | 96% |
11324 | 2017-07-05 00:05:57 | 90.58 | 98% |
9710 | 2017-02-24 08:10:28 | 89.51 | 94% |
9649 | 2017-02-22 04:44:08 | 77.53 | 92% |
9435 | 2017-02-13 08:47:39 | 85.80 | 94% |