Skip to content

Commit

Permalink
Assorted spelling/grammar/captitalization
Browse files Browse the repository at this point in the history
No functional change.
  • Loading branch information
Arjun Temurnikar authored and mcostalba committed Dec 4, 2013
1 parent f026517 commit 190aea4
Show file tree
Hide file tree
Showing 2 changed files with 9 additions and 9 deletions.
4 changes: 2 additions & 2 deletions src/benchmark.cpp
Expand Up @@ -66,10 +66,10 @@ static const char* Defaults[] = {


/// benchmark() runs a simple benchmark by letting Stockfish analyze a set
/// 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
/// 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 12), 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.

Expand Down
14 changes: 7 additions & 7 deletions src/bitbase.cpp
Expand Up @@ -25,7 +25,7 @@

namespace {

// The possible pawns squares are 24, the first 4 files and ranks from 2 to 7
// There are 24 possible pawn squares: the first 4 files and ranks from 2 to 7
const unsigned IndexMax = 2*24*64*64; // stm * psq * wksq * bksq = 196608

// Each uint32_t stores results of 32 positions, one per bit
Expand Down Expand Up @@ -90,7 +90,7 @@ void Bitbases::init_kpk() {
for (idx = 0; idx < IndexMax; ++idx)
db.push_back(KPKPosition(idx));

// Iterate through the positions until no more of the unknown positions can be
// Iterate through the positions until none of the unknown positions can be
// changed to either wins or draws (15 cycles needed).
while (repeat)
for (repeat = idx = 0; idx < IndexMax; ++idx)
Expand Down Expand Up @@ -120,14 +120,14 @@ namespace {

else if (us == WHITE)
{
// Immediate win if pawn can be promoted without getting captured
// Immediate win if a pawn can be promoted without getting captured
if ( rank_of(psq) == RANK_7
&& wksq != psq + DELTA_N
&& ( square_distance(bksq, psq + DELTA_N) > 1
||(StepAttacksBB[KING][wksq] & (psq + DELTA_N))))
result = WIN;
}
// Immediate draw if it is stalemate or king captures undefended pawn
// Immediate draw if it is a stalemate or a king captures undefended pawn
else if ( !(StepAttacksBB[KING][bksq] & ~(StepAttacksBB[KING][wksq] | StepAttacksBB[PAWN][psq]))
|| (StepAttacksBB[KING][bksq] & psq & ~StepAttacksBB[KING][wksq]))
result = DRAW;
Expand All @@ -138,13 +138,13 @@ namespace {

// White to Move: If one move leads to a position classified as WIN, the result
// of the current position is WIN. If all moves lead to positions classified
// as DRAW, the current position is classified DRAW otherwise the current
// as DRAW, the current position is classified as DRAW, otherwise the current
// position is classified as UNKNOWN.
//
// Black to Move: If one move leads to a position classified as DRAW, the result
// of the current position is DRAW. If all moves lead to positions classified
// as WIN, the position is classified WIN otherwise the current position is
// classified UNKNOWN.
// as WIN, the position is classified as WIN, otherwise the current position is
// classified as UNKNOWN.

const Color Them = (Us == WHITE ? BLACK : WHITE);

Expand Down

0 comments on commit 190aea4

Please sign in to comment.