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.
—from Artificial Intelligence Second Edition, a book by Patrick Henry Winston
Active since April 25, 2023.
278 total characters in this text.
View Pit Stop page for this text
| Rank | Username | WPM | Accuracy | Date |
|---|---|---|---|---|
| 1. | retired... for now..? (clou... | 122.93 | 99% | 2023-04-25 |
| Universe | Races | Average WPM | First Race |
|---|---|---|---|
| Default (English) | 13,320 | 78.75 | January 9, 2017 |
| Instant Death Mode | 10 | 103.06 | March 3, 2020 |
| New English Texts Are Here | 1 | 122.93 | April 25, 2023 |
| ᗜ Stenography | 1 | 73.57 | July 14, 2021 |