more typos

Author: Juanvoid01

docs/AlphaDeepChess/Capitulos/DescripcionTrabajo.tex

@@ -212,7 +212,7 @@ \section{Evaluation: materialistic approach}\label{sec:evaluation}
 
 \noindent Where $V(x)$ denotes the value of piece $x$.
 
-\subsection*{Piece square tables (PST's)}
+\subsection*{Piece square tables (PSTs)}
 
 \noindent The basic material evaluation described earlier has a significant limitation, it does not consider the fact that a piece could have more power in different squares of the board. For instance, as illustrated in the following image, a knight placed in the center can control up to eight squares, while a knight positioned in the corner can reach only two.
 
@@ -226,7 +226,7 @@ \subsection*{Piece square tables (PST's)}
         markmoves={h8-g6,h8-f7,d4-b5,d4-b3,d4-c2,d4-c6,d4-e6,d4-e2,d4-f5,d4-f3},
         arrow=to
     ]
-    \caption*{Knight's movement on corner vs in center.}\label{fig:knight-movement-corner-and-center}
+    \caption*{Knight's movement on corner vs in the center.}\label{fig:knight-movement-corner-and-center}
 \end{figure}
 
 \noindent The solution is to add a bonus or a penalization to the piece depending on the square it occupies. This is called a piece square table (PST). For each piece type, a PST assigns a positional bonus based on the square it occupies. These tables are typically implemented as arrays indexed by square and piece type~\cite{PieceSquareTables}.

docs/AlphaDeepChess/Capitulos/ImprovementTechniques.tex

@@ -153,7 +153,7 @@ \subsection*{Magic bitboards}
 
 \vspace{1em}
 
-\noindent Magic bitboards technique used to reduce the size of the look up table. We cut off unnecesary information in the blockers bitboard, excluding the board borders and the squares outside its attack pattern.
+\noindent Magic bitboards technique used to reduce the size of the look up table. We cut off unnecessary information in the blockers bitboard, excluding the board borders and the squares outside its attack pattern.
 
 \vspace{1em}
 

docs/AlphaDeepChess/Capitulos/Introduccion.tex

@@ -43,7 +43,7 @@ \section{Work plan}
     \item Analyze the results and write the final report.
 \end{enumerate}
 
-\noindent In the following~\cref{sec:basicConcepts}, we will explain about the basic concepts of chess, but if you already have the knowledge we recommend you to advance directly to the next~\cref{cap:estadoDeLaCuestion}.
+\noindent In the following~\cref{sec:basicConcepts}, we will explain about the basic concepts of chess, but if you already have the knowledge, we recommend to advance directly to the next~\cref{cap:estadoDeLaCuestion}.
 
 \section{Chess fundamentals}\label{sec:basicConcepts}
 

docs/AlphaDeepChess/Cascaras/abstract.tex

@@ -14,4 +14,4 @@ \section*{\tituloPortadaEngVal}
 
 \section*{Keywords}
 
-\noindent chess, artificial intelligence, chess engine, alpha-beta pruning, iterative deepening, quiescence search, move ordering, transposition table, zobrist hashing, magic bitboards
+\noindent chess, artificial intelligence, chess engine, alpha-beta pruning, iterative deepening, quiescence search, move ordering, transposition table, Zobrist hashing, magic bitboards

docs/AlphaDeepChess/Cascaras/agradecimientos.tex

@@ -4,7 +4,7 @@
 
 \chapter*{Acknowledgments}
 
-\noindent To the Chess programming Wiki for its extensive repository of high-level resources on chess engine development~\cite{ChessProgrammingWiki}.
+\noindent To the Chess Programming Wiki for its extensive repository of high-level resources on chess engine development~\cite{ChessProgrammingWiki}.
 
 \vspace{1em}
 

docs/AlphaDeepChess/Cascaras/resumen.tex

@@ -14,4 +14,4 @@ \section*{\tituloPortadaVal}
 
 \section*{Palabras clave}
 
-\noindent ajedrez, inteligencia artificial, motor de ajedrez, poda alfa-beta, búsqueda en profundidad iterativa, búsqueda quiescente, ordenación de movimientos, tabla de transposiciones, zobrist hashing, bitboards mágicos
+\noindent ajedrez, inteligencia artificial, motor de ajedrez, poda alfa-beta, búsqueda en profundidad iterativa, búsqueda quiescente, ordenación de movimientos, tabla de transposiciones, Zobrist hashing, bitboards mágicos

docs/AlphaDeepChess/TFGTeXiS.pdf

@@ -9,13 +9,13 @@
  * This technique is used to optimize the memory space of the lookup table of rook and bishop moves.
  * 
  * The lookup table is indexed by piece square and the blockers bitboard (pieces that block the path of the piece).
- * We cut off unnecesary information like the board borders and the squares outside its attack pattern.
+ * We cut off unnecessary information like the board borders and the squares outside its attack pattern.
  * Optimally we could use 11 bits for bishop moves (2048 > 1428) and 13 bits for rooks (8196 > 4900).
  * 
  * A magic number is a multiplier to the index with the following property: 
  *      - keeps intact the important info about the blockers (the nearest blockers to the piece are intact).
  *        For example: [Rook] -> -> -> [pawn1][pawn2].
- *        In this case pawn2 is an unnecesary piece inside the blockers bitboard, because the piece that actually
+ *        In this case pawn2 is an unnecessary piece inside the blockers bitboard, because the piece that actually
  *        block the path of the rook is pawn1.
  *      
  *      - Reduces the index number close to the optimal size (ideally to fit inside 11 or 13 bits)
@@ -236,7 +236,7 @@ static inline constexpr uint64_t bishop_magic(Square square)
  */
 inline uint64_t magic_index_rook(uint64_t blockers, Square rook_square, uint64_t rook_attacks)
 {
-    // we cut unnecesary information to optimize memory space: board edges and squares outside the attack mask.
+    // we cut unnecessary information to optimize memory space: board edges and squares outside the attack mask.
     const uint64_t edges = ((ROW_1_MASK | ROW_8_MASK) & ~get_row_mask(rook_square.row())) |
         ((COL_A_MASK | COL_H_MASK) & ~get_col_mask(rook_square.col()));
     blockers &= rook_attacks & ~edges;
@@ -265,7 +265,7 @@ inline uint64_t magic_index_rook(uint64_t blockers, Square rook_square, uint64_t
  */
 inline uint64_t magic_index_bishop(uint64_t blockers, Square bishop_square, uint64_t bishop_attacks)
 {
-    // we cut unnecesary information to optimize memory space: board edges and squares outside the attack mask.
+    // we cut unnecessary information to optimize memory space: board edges and squares outside the attack mask.
     const uint64_t edges = ((ROW_1_MASK | ROW_8_MASK) & ~get_row_mask(bishop_square.row())) |
         ((COL_A_MASK | COL_H_MASK) & ~get_col_mask(bishop_square.col()));