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 |
---|---|---|---|
1465 | 2017-07-26 06:30:42 | 43.02 | 93% |
898 | 2017-05-11 04:16:44 | 30.46 | 83% |
767 | 2017-04-27 05:48:49 | 40.68 | 89% |
708 | 2017-04-26 03:27:34 | 34.19 | 87% |
581 | 2017-04-22 17:20:20 | 33.97 | 86% |