mirror of
https://github.com/sockspls/badfish
synced 2025-05-01 09:13:08 +00:00
Assorted grammar fixes
Mainly from Lyudmil Antonov and one from Henri Wiechers and Louis Zulli. No functional change.
This commit is contained in:
parent
1fee23a598
commit
a646f74e6a
8 changed files with 8 additions and 8 deletions
|
@ -69,7 +69,7 @@ static const char* Defaults[] = {
|
||||||
/// of positions for a given limit each. There are five parameters: the
|
/// of positions for a given limit each. There are five parameters: the
|
||||||
/// transposition table size, the number of search threads that should
|
/// transposition table size, the number of search threads that should
|
||||||
/// be used, the limit value spent for each position (optional, default is
|
/// 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
|
/// format (defaults are the positions defined above) and the type of the
|
||||||
/// limit value: depth (default), time in secs or number of nodes.
|
/// limit value: depth (default), time in secs or number of nodes.
|
||||||
|
|
||||||
|
|
|
@ -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 0- 5: white king square (from SQ_A1 to SQ_H8)
|
||||||
// bit 6-11: black king square (from SQ_A1 to SQ_H8)
|
// bit 6-11: black king square (from SQ_A1 to SQ_H8)
|
||||||
|
|
|
@ -177,7 +177,7 @@ inline Bitboard in_front_bb(Color c, Rank r) {
|
||||||
|
|
||||||
/// between_bb() returns a bitboard representing all squares between two squares.
|
/// 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
|
/// 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.
|
/// 0 is returned.
|
||||||
|
|
||||||
inline Bitboard between_bb(Square s1, Square s2) {
|
inline Bitboard between_bb(Square s1, Square s2) {
|
||||||
|
|
|
@ -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) {
|
||||||
|
|
||||||
|
|
|
@ -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<>
|
template<>
|
||||||
ScaleFactor Endgame<KNPK>::operator()(const Position& pos) const {
|
ScaleFactor Endgame<KNPK>::operator()(const Position& pos) const {
|
||||||
|
|
||||||
|
|
|
@ -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 {
|
||||||
|
|
||||||
|
|
|
@ -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 basetime [sudden death!]
|
||||||
increment == 0 && movesToGo != 0 means: x moves in y minutes
|
increment == 0 && movesToGo != 0 means: x moves in y minutes
|
||||||
|
|
|
@ -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)
|
Option::Option(const char* v, Fn* f) : type("string"), min(0), max(0), idx(Options.size()), on_change(f)
|
||||||
{ defaultValue = currentValue = v; }
|
{ defaultValue = currentValue = v; }
|
||||||
|
|
Loading…
Add table
Reference in a new issue