Updated the docs

chesslablab · Dec 31, 2024 · cc1425d · cc1425d
1 parent 75a79f2
commit cc1425d
Showing 1 changed file with 2 additions and 6 deletions.
diff --git a/docs/heuristics.md b/docs/heuristics.md
@@ -149,6 +149,8 @@ Array
 )
 ```
 
+This is an estimate that suggests 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
 
 As chess champion William Steinitz pointed out, a strong position can be created by accumulating small advantages. The relative value of the position without considering checkmate is obtained by counting the advantages in the evaluation array.
@@ -220,8 +222,6 @@ echo $median;
 0.24
 ```
 
-White is slightly better than Black because the value obtained is a positive number.
-
 ### Mode Evaluation
 
 The mode is the value that appears most frequently in the evaluation array.
@@ -244,10 +244,6 @@ echo $mode;
 1
 ```
 
-White is slightly better than Black because the value obtained is a positive number.
-
-This is an estimate that suggests 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.
-
 ## Oscillations of a Game by Evaluation Feature
 
 [Chess\SanHeuristics](https://github.com/chesslablab/php-chess/blob/main/tests/unit/SanHeuristicsTest.php) returns the oscillations of an evaluation feature in the time domain.