newpages quitados

Author: Juanvoid01

docs/AlphaDeepChess/Capitulos/AnalysisOfImprovements.tex

@@ -84,7 +84,7 @@ \subsection*{Graphical user interface}
 \parbox{\textwidth}{\noindent The GUI provides a user-friendly interface that communicates with the engine using the UCI protocol under the hood, greatly enhancing the debugging and testing experience. This tool can be used after compiling the engine by running \texttt{AlphaDeepChessGUI.py} with Python.}
 
 
-\begin{figure}[H]
+\begin{figure}
     \centering
     \includegraphics[width=1.0\textwidth]{Imagenes/gui.png}
     \caption{\textit{AlphaDeepChess}'s GUI}\label{fig:gui}
@@ -280,8 +280,11 @@ \subsection*{Late move reductions}
     \label{tab:bestEngineConfiguration}
 \end{table}
 
+\vspace{3em}
+
+\noindent  We now compare the skill level of \textit{AlphaDeepChess} with the best configuration against \textit{Stockfish}.
 
-\noindent Now, we compare the skill level of \textit{AlphaDeepChess} with the best configuration against \textit{Stockfish}.
+\vspace{2em}
 
 \section{Evaluation versus \textit{Stockfish}}
 
@@ -290,7 +293,7 @@ \section{Evaluation versus \textit{Stockfish}}
 \medskip
 \end{center}
 
-\noindent \textit{AlphaDeepChess} lost all games against \textit{Stockfish}. This outcome was expected, as \textit{Stockfish} has an estimated Elo rating of around 3644~\cite{StockfishElo}, making it orders of magnitude stronger than the best human players. In contrast, as we will show in the next section, \textit{AlphaDeepChess} plays at a level comparable to a strong human player.
+\noindent \textit{AlphaDeepChess} was defeated in all games against \textit{Stockfish}. This result is not surprising, given that \textit{Stockfish} has an estimated Elo rating of approximately 3644~\cite{StockfishElo}, placing it far beyond even the strongest human players. In contrast, as we will demonstrate in the following section, \textit{AlphaDeepChess} performs at a level comparable to a strong player.
 
 \newpage
 

docs/AlphaDeepChess/Capitulos/DescripcionTrabajo.tex

@@ -17,21 +17,15 @@ \chapter{Basic engine architecture}\label{cap:descripcionTrabajo}
 
 \noindent We begin by examining the fundamental data structure used for chess position representation.
 
-\newpage
-
 \section{Chessboard representation: bitboards}
 
 \noindent The chessboard is represented using a list of \textit{bitboards}. A bitboard is a 64-bit variable in which each bit corresponds to a square on the board. A bit is set to \texttt{1} if a piece occupies the corresponding square and \texttt{0} otherwise. The least significant bit (LSB) represents the \texttt{a1} square, while the most significant bit (MSB) corresponds to \texttt{h8}~\cite{Bitboards}.
- 
-\vspace{1em}
-
-\noindent \parbox{\textwidth}{The complete implementation can be found in the \texttt{Board} class file in \texttt{include\textbackslash{}board\textbackslash{}board.hpp} and \texttt{src\textbackslash{}board\textbackslash{}board.cpp}.}
 
 \vspace{1em}
 
-\noindent A list of twelve bitboards is used, one for each type of chess piece.~\cref{fig:bitboardPositionExample} illustrates this concept with a chess position example.
+\noindent A list of twelve bitboards is used, one for each type of chess piece.~\cref{fig:bitboardPositionExample} illustrates this concept with a chess position example. The main advantages of bitboards is that we can operate on multiple squares simultaneously using bitwise operations (see~\cref{fig:bitboardMaskOperation}). For example, we can determine if there are any black pawns on the fifth rank by performing a bitwise AND operation with the corresponding mask.
 
-\begin{figure}[H]
+\begin{figure}[t]
     \begin{minipage}[c]{0.35\textwidth}
         \newchessgame
         \chessboard[
@@ -60,31 +54,31 @@ \section{Chessboard representation: bitboards}
     \caption{List of bitboards data structure example.}\label{fig:bitboardPositionExample}
 \end{figure}
 
-\noindent The main advantages of bitboards is that we can operate on multiple squares simultaneously using bitwise operations. For example, we can determine if there are any black pawns on the fifth rank by performing a bitwise AND operation with the corresponding mask.
-
 \begin{figure}[H]
     \centering
-    \begin{minipage}[c]{0.30\textwidth}
+    \begin{minipage}[c]{0.3\textwidth}
         \centering
         \includegraphics[width=\textwidth]{Imagenes/bitboard_black_pawns.png}
         \caption*{Bitboard of black pawns}
     \end{minipage}
     \hfill
-    \begin{minipage}[c]{0.30\textwidth}
+    \begin{minipage}[c]{0.3\textwidth}
         \centering
         \includegraphics[width=\textwidth]{Imagenes/fifth_rank_mask.png}
         \caption*{Fifth rank mask}
     \end{minipage}
     \hfill
-    \begin{minipage}[c]{0.30\textwidth}
+    \begin{minipage}[c]{0.3\textwidth}
         \centering
         \includegraphics[width=\textwidth]{Imagenes/bitboardMaskResult.png}
         \caption*{Pawn's bitboard \& mask}
     \end{minipage}
-    \caption*{Bitboard mask operation example.}\label{fig:bitboardMaskOperation}
+    \caption{Bitboard mask operation example.}\label{fig:bitboardMaskOperation}
     \vspace{-\baselineskip}
 \end{figure}
 
+\newpage
+
 \subsection*{Game state}
 
 \noindent In addition, we need to store the game state information. We designed a compact 64-bit structure to encapsulate all relevant data, enabling efficient copying of the complete game state through a single memory operation. The structure contains the following key fields:

docs/AlphaDeepChess/Capitulos/ImprovementTechniques.tex

@@ -10,14 +10,12 @@ \chapter{Improvement techniques}\label{cap:ImprovementTechniques}
     \item Search with late move reductions.
 \end{itemize}
 
-\newpage
-
 \section{Transposition table}\label{sec:tt}
 
 \noindent As discused in the previous chapter (see~\cref{sec:iterativeDeepening}), the basic implementation of the chess engine generates a large amount of redundant calculations due to the iterative deepening approach and also the concept of transpositions: situations in which the same board position is reached through different sequences of moves in the game tree.
-\noindent the Following image illustrates a position that can arise through multiple move orders. Where the white king could go to the g3 square from multiple paths.
+\noindent~\cref{fig:transposition_example} illustrates a position that can arise through multiple move orders. Where the white king could go to the g3 square from multiple paths.
 
-\begin{figure}[H]
+\begin{figure}
     \centering
     \newchessgame
     \chessboard[
@@ -27,7 +25,7 @@ \section{Transposition table}\label{sec:tt}
         markmoves={c1-e3,e3-g3,c1-g1,g1-g3},
         arrow=to
     ]
-    \caption*{Lasker-Reichhelm Position, transposition example.}\label{fig:transposition_example}
+    \caption{Lasker-Reichhelm Position, transposition example.}\label{fig:transposition_example}
 \end{figure}
 
 \vspace{1em}
@@ -183,7 +181,7 @@ \subsection*{Magic bitboards}
         color=red, markfields={d6,f4,d2},
         color=green, markfields={c4,b4,a4,e4,d5,d3}
     ]
-    \caption*{Chess position with white rook legal moves in green and blockers in red.}\label{fig:magics_position}
+    \caption{Chess position with white rook legal moves in green and blockers in red.}\label{fig:magics_position}
 \end{figure}
 
 \subsection*{Magic number generation}
@@ -471,18 +469,15 @@ \section{Late move reductions}
 \vspace{1em}
 
 \par
-In our implementation, a reduction of one ply is applied to non-capturing moves when the side to move is not in check, the remaining search depth is at least three plies, and the move index is beyond a threshold of the 10th move. The reduction condition is formally defined in Equation~\cref{eq:lmr}:
-
-\vspace{1em}
+In our implementation, a reduction of one ply is applied to non-capturing moves when the side to move is not in check, the remaining search depth is at least three plies, and the move index is beyond a threshold of the 10th move. The reduction condition is formally defined in the following equation:
 
-\begin{equation}
+\begin{equation*}
 \text{reduction} = 
 \begin{cases}
 1, & \text{if } \text{isNotCheck} \wedge \text{depth} \geq 3 \wedge moveIndex \geq 10 \\
 0, & \text{otherwise}
 \end{cases}
-\label{eq:lmr}
-\end{equation}
+\end{equation*}
 
 \vspace{1em}
 

docs/AlphaDeepChess/TFGTeXiS.pdf

@@ -791,6 +791,7 @@
 \crefname{chapter}{Chapter}{Chapters}
 \crefname{table}{Table}{Tables}
 \crefname{listing}{Listing}{Listings}
+\crefname{equation}{Equation}{Equations}
 
 \usepackage{enumitem}
 

docs/AlphaDeepChess/TeXiS/TeXiS_pream.tex

@@ -7,15 +7,17 @@ @misc{PVSplitting
   lastaccess   = {March, 2025}
 }
 
-@misc{Shannon1950,
-  author       = {Claude E. Shannon},
-  title        = {Programming a Computer for Playing Chess},
-  howpublished = {Computer History Museum Archive},
-  year         = {1950},
-  url      = {https://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf},
-  lastaccess   = {November, 2024}
+@article{Shannon1950,
+	author = {Claude E. Shannon},
+	title = {Programming a Computer for Playing Chess},
+	journal = {Philosophical Magazine},
+	volume = {41},
+	year = {1950},
+	pages = {256--275},
+	doi = {10.1080/14786445008521796},
 }
 
+%https://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf
 @misc{LawsOfChess,
   author       = {Fédération Internationale des Échecs},
   title        = {FIDE Laws of chess},
@@ -72,7 +74,7 @@ @misc{PextInstruction
 
 @misc{UciProtocol,
   author       = {Stefan-Meyer Kahlen},
-  title        = {Description of the universal chess interface (UCI)},
+  title        = {Description of the universal chess interface ({UCI})},
   howpublished = {Online},
   year         = {2004},
   url      = {https://www.wbec-ridderkerk.nl/html/UCIProtocol.html},
@@ -191,12 +193,12 @@ @misc{TranspositionTable
 }
 
 @misc{Perft,
-  author       = {Chess Programming Wiki},
+  author       = {},
   title        = {Perft},
-  howpublished = {Online},
   year         = {2025},
-  url      = {https://www.chessprogramming.org/Perft},
-  lastaccess   = {May, 2025}
+  organization = {Chess Programming Wiki},
+  url          = {https://www.chessprogramming.org/Perft},
+  urldate      = {May, 2025}
 }
 
 @misc{PerftResults,
@@ -211,7 +213,7 @@ @misc{PerftResults
 @misc{CuteChess,
   author       = {CuteChess Developers},
   title        = {CuteChess repository},
-  howpublished = {Github},
+  howpublished = {GitHub},
   year         = {2024},
   url      = {https://github.com/cutechess/cutechess},
   lastaccess   = {May, 2025}
@@ -282,7 +284,7 @@ @misc{LateMoveReductions
 @misc{MagicsSource,
   author       = {maksimKorzh},
   title        = {Magics},
-  howpublished = {Github},
+  howpublished = {GitHub},
   year         = {2020},
   url          = {https://github.com/maksimKorzh/chess_programming/blob/master/src/magics/magics.txt},
   lastaccess   = {May, 2025}
@@ -291,7 +293,7 @@ @misc{MagicsSource
 @misc{ChessProgrammingYT,
   author       = {chessprogramming591},
   title        = {Chess Programming},
-  howpublished = {youtube},
+  howpublished = {YouTube},
   year         = {2020},
   url          = {https://www.youtube.com/@chessprogramming591},
   lastaccess   = {May, 2025}
@@ -300,7 +302,7 @@ @chessprogramming591
 @misc{SebastianLagueYT,
   author       = {Sebastian Lague},
   title        = {Coding Adventure: Chess},
-  howpublished = {youtube},
+  howpublished = {YouTube},
   year         = {2021},
   url          = {https://www.youtube.com/watch?v=U4ogK0MIzqk&list=PLFt_AvWsXl0cvHyu32ajwh2qU1i6hl77c},
   lastaccess   = {May, 2025}
@@ -327,7 +329,7 @@ @misc{MagnusCarlsenElo
 @misc{NNUE,
   author       = {Stockfish developers},
   title        = {NNUE},
-  howpublished = {github},
+  howpublished = {GitHub},
   year         = {2025},
   url          = {https://github.com/official-stockfish/nnue-pytorch/blob/master/docs/nnue.md},
   lastaccess   = {May, 2025}