Improved the docs

chesslablab · Jan 15, 2025 · 21a684c · 21a684c
1 parent 0f00162
commit 21a684c
Showing 1 changed file with 3 additions and 1 deletion.
diff --git a/docs/heuristics.md b/docs/heuristics.md
@@ -149,7 +149,9 @@ Array
 )
 ```
 
-This data structure is used to estimate who may be better without considering checkmate. Please note that a heuristic evaluation is not the same thing as a chess calculation. Heuristic evaluations are often correct but may fail because they are based on probabilities.
+You may be wondering why two functions instead of just one. Well, that's because a computer may well take about 0.2 seconds to evaluate a chess position, which is perfectly fine. Now, if we take this number and multiply it by 80 different positions that a chess game has on average, the result obtained is 16 seconds. The fast evaluation function comes to the rescue in these situations as a workaround.
+
+The evaluation array is used to estimate who may be better without considering checkmate. Please note that a heuristic evaluation is not the same thing as a chess calculation. Heuristic evaluations are often correct but may fail because they are based on probabilities.
 
 ### Steinitz Evaluation