Improved spelling, grammar and comment

Author: Ben Koshy

No functional change
This commit is contained in:
Stéphane Nicolet
2018-02-04 00:13:56 +01:00
parent 378c8bdbb8
commit 0f6f42cd83
2 changed files with 4 additions and 3 deletions
+2 -2
View File
@@ -98,9 +98,9 @@ for a quick reference.
### Resource For Understanding the Code Base ### Resource For Understanding the Code Base
* [Chessprogramingwiki](https://chessprogramming.wikispaces.com) has good overall chess engines explanations * [Chess Programming Wiki](https://chessprogramming.wikispaces.com) has good overall chess engines explanations
(techniques used here are well explained like hash maps etc), it was (techniques used here are well explained like hash maps etc), it was
also recommended by the [support at stockfish.](http://support.stockfishchess.org/discussions/questions/1132-how-to-understand-stockfish-sources) also recommended by the [support team at stockfish.](http://support.stockfishchess.org/discussions/questions/1132-how-to-understand-stockfish-sources)
* [Here](https://chessprogramming.wikispaces.com/Stockfish) you can find a set of features and techniques used by stockfish and each of them is explained at the wiki, however, it's a generic way rather than focusing on stockfish's own implementation, but it will still help you. * [Here](https://chessprogramming.wikispaces.com/Stockfish) you can find a set of features and techniques used by stockfish and each of them is explained at the wiki, however, it's a generic way rather than focusing on stockfish's own implementation, but it will still help you.
+2 -1
View File
@@ -626,7 +626,8 @@ namespace {
return score; return score;
} }
// helper used by evaluate_passed_pawns to cap the distance // king_distance() returns an estimate of the distance that the king
// of the given color has to run to reach square s.
template<Tracing T> template<Tracing T>
int Evaluation<T>::king_distance(Color c, Square s) { int Evaluation<T>::king_distance(Color c, Square s) {
return std::min(distance(pos.square<KING>(c), s), 5); return std::min(distance(pos.square<KING>(c), s), 5);