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 July 14, 2021.
278 total characters in this text.
View Pit Stop page for this text
Rank | Username | WPM | Accuracy | Date |
---|---|---|---|---|
1. | Sam (jet993) | 88.45 | 95% | 2024-06-14 |
2. | rabbitgrowth (rabbitgrowth) | 73.57 | 90% | 2021-07-14 |
3. | tom (tom12233) | 65.44 | 91% | 2024-11-14 |
4. | isthislewz (isthislewz_cole... | 65.11 | 93% | 2021-10-28 |
5. | Fayez Johan (mystery420) | 61.17 | 94.8% | 2024-01-06 |
6. | Vikash (sky_223) | 60.48 | 97% | 2023-06-06 |
7. | rodaa (rodaaa) | 46.17 | 94% | 2023-01-19 |
8. | Usama Sardar (usama_0_sardar) | 38.45 | 95% | 2025-01-30 |
9. | Dom Toretto (dom_torettoo) | 37.42 | 97% | 2024-09-22 |
10. | Mohit (abhay7000000) | 36.88 | 94% | 2024-10-22 |
Universe | Races | Average WPM | First Race |
---|---|---|---|
Default (English) | 13,936 | 78.23 | January 9, 2017 |
Instant Death Mode | 10 | 103.06 | March 3, 2020 |
ᗜ Stenography | 9 | 58.33 | July 14, 2021 |
New English Texts Are Here | 1 | 122.93 | April 25, 2023 |