Assorted grammar fixes

Mainly from Lyudmil Antonov and
one from Henri Wiechers and Louis Zulli.

No functional change.

diff --git a/src/benchmark.cpp b/src/benchmark.cpp
index 0adbc8614fc56295da6f78292e7881cc18f357a9..7ca4b59e0ff13e7112228cd27d236c42bdc0d9cb 100644 (file)
--- a/src/benchmark.cpp
+++ b/src/benchmark.cpp
@@ -69,7 +69,7 @@ static const char* Defaults[] = {
 /// of positions for a given limit each. There are five parameters: the
 /// transposition table size, the number of search threads that should
 /// be used, the limit value spent for each position (optional, default is
 /// of positions for a given limit each. There are five parameters: the
 /// transposition table size, the number of search threads that should
 /// be used, the limit value spent for each position (optional, default is

-/// depth 12), an optional file name where to look for positions in FEN
+/// depth 13), an optional file name where to look for positions in FEN

 /// format (defaults are the positions defined above) and the type of the
 /// limit value: depth (default), time in secs or number of nodes.
 
 /// format (defaults are the positions defined above) and the type of the
 /// limit value: depth (default), time in secs or number of nodes.
 

diff --git a/src/bitbase.cpp b/src/bitbase.cpp
index 7322a00ff79587bb069c0abde373d328169d64c3..dbda28e0019cf9e161b826cd4130307f2db6cb97 100644 (file)
--- a/src/bitbase.cpp
+++ b/src/bitbase.cpp
@@ -33,7 +33,7 @@ namespace {
 
   // A KPK bitbase index is an integer in [0, IndexMax] range
   //
 
   // A KPK bitbase index is an integer in [0, IndexMax] range
   //

-  // Information is mapped in a way that minimizes number of iterations:
+  // Information is mapped in a way that minimizes the number of iterations:

   //
   // bit  0- 5: white king square (from SQ_A1 to SQ_H8)
   // bit  6-11: black king square (from SQ_A1 to SQ_H8)
   //
   // bit  0- 5: white king square (from SQ_A1 to SQ_H8)
   // bit  6-11: black king square (from SQ_A1 to SQ_H8)

diff --git a/src/bitboard.h b/src/bitboard.h
index e8db3acb43c3a6ce55f55909abc27af804de446d..a6850ba0f22b2db576697bbdb849618386ab4eed 100644 (file)
--- a/src/bitboard.h
+++ b/src/bitboard.h
@@ -177,7 +177,7 @@ inline Bitboard in_front_bb(Color c, Rank r) {
 
 /// between_bb() returns a bitboard representing all squares between two squares.
 /// For instance, between_bb(SQ_C4, SQ_F7) returns a bitboard with the bits for
 
 /// between_bb() returns a bitboard representing all squares between two squares.
 /// For instance, between_bb(SQ_C4, SQ_F7) returns a bitboard with the bits for

-/// square d5 and e6 set.  If s1 and s2 are not on the same line, file or diagonal,
+/// square d5 and e6 set.  If s1 and s2 are not on the same rank, file or diagonal,

 /// 0 is returned.
 
 inline Bitboard between_bb(Square s1, Square s2) {
 /// 0 is returned.
 
 inline Bitboard between_bb(Square s1, Square s2) {

diff --git a/src/book.cpp b/src/book.cpp
index d86f3d346ae65d3cb93a32475ee51a3339a64575..c27e878c194642fdb1b5bd24dc4acf1faea48d36 100644 (file)
--- a/src/book.cpp
+++ b/src/book.cpp
@@ -372,7 +372,7 @@ template<> PolyglotBook& PolyglotBook::operator>>(Entry& e) {
 
 
 /// open() tries to open a book file with the given name after closing any
 
 
 /// open() tries to open a book file with the given name after closing any

-/// exsisting one.
+/// existing one.

 
 bool PolyglotBook::open(const char* fName) {
 
 
 bool PolyglotBook::open(const char* fName) {
 

diff --git a/src/endgame.cpp b/src/endgame.cpp
index dbb98310239903e4215b72bcb25fac25635e0759..869a36d76ceb5d0358765e7dd89ef639f240f6f6 100644 (file)
--- a/src/endgame.cpp
+++ b/src/endgame.cpp
@@ -817,7 +817,7 @@ ScaleFactor Endgame<KBPKN>::operator()(const Position& pos) const {
 
 
 /// KNP vs K. There is a single rule: if the pawn is a rook pawn on the 7th rank
 
 
 /// KNP vs K. There is a single rule: if the pawn is a rook pawn on the 7th rank

-/// and the defending king prevents the pawn from advancing the position is drawn.
+/// and the defending king prevents the pawn from advancing, the position is drawn.

 template<>
 ScaleFactor Endgame<KNPK>::operator()(const Position& pos) const {
 
 template<>
 ScaleFactor Endgame<KNPK>::operator()(const Position& pos) const {
 

diff --git a/src/position.cpp b/src/position.cpp
index 23ecf55732a0b87626374e87e9c1dc4c54f4ee7a..755e22d85a7c9317d2682f5838fda4b6bfd6a11c 100644 (file)
--- a/src/position.cpp
+++ b/src/position.cpp
@@ -614,7 +614,7 @@ bool Position::pseudo_legal(const Move m) const {
 }
 
 
 }
 
 

-/// Position::move_gives_check() tests whether a pseudo-legal move gives a check
+/// Position::gives_check() tests whether a pseudo-legal move gives a check

 
 bool Position::gives_check(Move m, const CheckInfo& ci) const {
 
 
 bool Position::gives_check(Move m, const CheckInfo& ci) const {
 

diff --git a/src/timeman.cpp b/src/timeman.cpp
index 0348b677f4597ef5aaf3075b604e8f50e16a1e71..9f131d46d512d0ba6e4494ec81db724bd7698524 100644 (file)
--- a/src/timeman.cpp
+++ b/src/timeman.cpp
@@ -66,7 +66,7 @@ void TimeManager::pv_instability(double bestMoveChanges) {
 
 void TimeManager::init(const Search::LimitsType& limits, int currentPly, Color us)
 {
 
 void TimeManager::init(const Search::LimitsType& limits, int currentPly, Color us)
 {

-  /* We support four different kind of time controls:
+  /* We support four different kinds of time controls:

 
       increment == 0 && movesToGo == 0 means: x basetime  [sudden death!]
       increment == 0 && movesToGo != 0 means: x moves in y minutes
 
       increment == 0 && movesToGo == 0 means: x basetime  [sudden death!]
       increment == 0 && movesToGo != 0 means: x moves in y minutes

diff --git a/src/ucioption.cpp b/src/ucioption.cpp
index dc76af9e42f746f8c1d799fcd464c774a55247e9..0ef892bd9febfe9401eaa4b90770fb57614a9055 100644 (file)
--- a/src/ucioption.cpp
+++ b/src/ucioption.cpp
@@ -113,7 +113,7 @@ std::ostream& operator<<(std::ostream& os, const OptionsMap& om) {
 }
 
 
 }
 
 

-/// Option c'tors and conversion operators
+/// Option class constructors and conversion operators

 
 Option::Option(const char* v, Fn* f) : type("string"), min(0), max(0), idx(Options.size()), on_change(f)
 { defaultValue = currentValue = v; }
 
 Option::Option(const char* v, Fn* f) : type("string"), min(0), max(0), idx(Options.size()), on_change(f)
 { defaultValue = currentValue = v; }