updating files

curso-search/Astar.aux

@@ -38,10 +38,10 @@
 \@writefile{nav}{\headcommand {\beamer@framepages {16}{17}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{6}{18/18}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {18}{18}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{7}{19/19}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {19}{19}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{19}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{19}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{19}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {19}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {7}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{7}{19/19}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {19}{19}}}

curso-search/Astar.nav

@@ -11,10 +11,10 @@
 \headcommand {\beamer@framepages {16}{17}}
 \headcommand {\slideentry {0}{0}{6}{18/18}{}{0}}
 \headcommand {\beamer@framepages {18}{18}}
+\headcommand {\slideentry {0}{0}{7}{19/19}{}{0}}
+\headcommand {\beamer@framepages {19}{19}}
 \headcommand {\beamer@partpages {1}{19}}
 \headcommand {\beamer@subsectionpages {1}{19}}
 \headcommand {\beamer@sectionpages {1}{19}}
 \headcommand {\beamer@documentpages {19}}
 \headcommand {\def \inserttotalframenumber {7}}
-\headcommand {\slideentry {0}{0}{7}{19/19}{}{0}}
-\headcommand {\beamer@framepages {19}{19}}

curso-search/Astar.tex

@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/Astar.tex.bak

@@ -236,17 +236,27 @@ Pues está sobreestimando el costo para el nodo $D$, con ello conduciendo al agen
 \end{center}
 }
 \note<1>{
-Una heurística es consistente o monotónica si para cada sucesor de todo vertice del grafo de estados acciones, la heurística del vértice es menor o igual que la heurística de
+Una heurística es consistente o monotónica si para cada sucesor de todo vertice del grafo de estados acciones, la heurística del vértice es menor o igual que la heurística de la suma del costo de la transición del vertice al sucesor con la heurística del sucesor.
+
+En este ejemplo la heurística mostrada cumple con esta propiedad.
 }
 \only<2>{
 \begin{center}
-\includegraphics[scale=0.5]{admisible-02.pdf}
+\includegraphics[scale=0.4]{consistencia-02.pdf}
 \end{center}
 }
 \note<2>{
-En este ejemplo tenemos una heurística no admisible.
+Aquí ilustramos un ejemplo donde la heurística no es monotónica.
 
-Pues está sobreestimando el costo para el nodo $D$, con ello conduciendo al agente por un camino más largo.
+Si avanzamos en la dirección del objetivo por el camino $A$, $C$ y $B$.
+
+Observamos que para el nodo $A$ la función $h$ no es menor que la suma del costo a $C$, que es 1, con la heurística del nodo $C$ que es 2.
+
+Esto significa que el valor de $f(A) = g(A)+ 4$ es mayor que el valor $f(C) = g(A) + 1 + 2$. Esto al avanzar en la profundidad observamos que el valor $f$ no se incrementa, sino que disminuye.
+
+Esto no es bueno para $A^*$, pues una heurística no monotónica puede llevarnos a soluciones subóptimas.
+
+Admisibilidad de una heurística esta implicada si la heurística es consistente. 
 }
 
 \end{frame}

curso-search/IDAstar.aux

@@ -33,10 +33,10 @@
 \@writefile{loa}{\contentsline {algocf}{\numberline {}{\ignorespaces $\text  {IDA}^*$}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{3}{3/3}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {3}{3}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{4}{4/84}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {4}{84}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{84}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{84}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{84}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {84}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {4}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{4}{4/84}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {4}{84}}}

curso-search/IDAstar.nav

@@ -5,10 +5,10 @@
 \headcommand {\beamer@framepages {2}{2}}
 \headcommand {\slideentry {0}{0}{3}{3/3}{}{0}}
 \headcommand {\beamer@framepages {3}{3}}
+\headcommand {\slideentry {0}{0}{4}{4/84}{}{0}}
+\headcommand {\beamer@framepages {4}{84}}
 \headcommand {\beamer@partpages {1}{84}}
 \headcommand {\beamer@subsectionpages {1}{84}}
 \headcommand {\beamer@sectionpages {1}{84}}
 \headcommand {\beamer@documentpages {84}}
 \headcommand {\def \inserttotalframenumber {4}}
-\headcommand {\slideentry {0}{0}{4}{4/84}{}{0}}
-\headcommand {\beamer@framepages {4}{84}}

curso-search/IDAstar.tex

@@ -9,7 +9,7 @@
 \usepackage{multicol}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/bfs.log

-This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex 2017.8.31)  14 SEP 2018 12:07
+This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex 2018.11.8)  9 FEB 2019 17:37
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
@@ -1679,7 +1679,7 @@ Package atveryend Info: Empty hook `AtVeryVeryEnd' on input line 412.
 Here is how much of TeX's memory you used:
  20947 strings out of 493029
  411718 string characters out of 6136234
- 524200 words of memory out of 5000000
+ 524199 words of memory out of 5000000
  23908 multiletter control sequences out of 15000+600000
  8808 words of font info for 33 fonts, out of 8000000 for 9000
  1141 hyphenation exceptions out of 8191
@@ -1690,7 +1690,7 @@ e/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmss12.pfb></usr/share/texl
 ive/texmf-dist/fonts/type1/public/amsfonts/cm/cmss8.pfb></usr/share/texlive/tex
 mf-dist/fonts/type1/public/amsfonts/cm/cmss9.pfb></usr/share/texlive/texmf-dist
 /fonts/type1/public/amsfonts/cm/cmssi10.pfb>
-Output written on bfs.pdf (29 pages, 1928311 bytes).
+Output written on bfs.pdf (29 pages, 1928043 bytes).
 PDF statistics:
  1066 PDF objects out of 1200 (max. 8388607)
  967 compressed objects within 10 object streams

curso-search/bidireccional-notas.tex

+\documentclass[xcolor=dvipsnames]{beamer}
+\usepackage[spanish]{babel}
+\usepackage[latin1]{inputenc}
+\usepackage{amsmath}
+\usepackage{pgfpages}
+\usepackage[makeroom]{cancel}
+
+% descomentar para generar handouts con notas
+\setbeameroption{show notes on second screen=right}
+\usepackage{tikz}
+\tikzstyle{every picture}+=[remember picture]
+
+\usefonttheme[onlymath]{serif}
+\usepackage{verbatim}
+\usepackage{pifont}
+\usetheme{Antibes} 
+\usecolortheme{lily} 
+\usepackage{graphicx}
+\usepackage{hyperref}
+\newcommand{\I}[1]{\mathit{#1}}
+\newcommand{\cierto}{\I{cierto}}
+\newcommand{\falso}{\I{falso}}
+
+\DeclareMathOperator*{\argmax}{argmax}
+\spanishdecimal{.}
+
+\title{Algoritmo de búsqueda Bidireccional}
+\author{Stalin Muñoz Gutiérrez}
+\institute{
+Centro de Ciencias de la Complejidad\\
+  Universidad Nacional Aut\'onoma de Mexico (UNAM)}
+\date{}
+
+
+\begin{document}
+\parindent 2em
+
+\frame
+{
+\titlepage
+\note<1>{
+Hoy veremos el algoritmo de búsqueda bidireccional.
+
+Este es una variación interesante del algoritmo BFS.
+
+Para poder aplicar el algoritmo vamos a requerir de condiciones adicionales.
+
+Una condición es conocer el estado meta. Si no conocemos el estado meta o hay varios estados meta, no podemos aplicar el algoritmo directamente.
+
+La otra condición es que para cualquier estado podamos conocer el conjunto de acciones y estados de los que es sucesor.
+}
+}
+
+\begin{frame}[<+->]
+\frametitle{Algoritmo de búsqueda bidireccional}
+\begin{block}{Algoritmo basado en BFS}
+Dos búsquedas por turnos.
+\note<1>{
+El algoritmo de búsqueda bidireccional, es en realidad dos búsquedas por turnos.
+
+Las búsquedas podrían hacerse de manera paralela, pero requeriría modificar ligeramente el algoritmo que vamos a presentar.
+}
+\begin{itemize}
+\item Una búsqueda progresiva o hacia adelante comenzando en el nodo inicial.
+\note<2>{
+La primera de las búsquedas es una búsqueda progresiva tipo BFS que comienza con el nodo inicial.
+
+}
+\item Otra búsqueda regresiva o hacia atrás comenzando con el nodo meta.
+\note<3>{
+
+La segunda búsqueda es una búsqueda regresiva o hacía atrás tipo BFS empezando del nodo meta.
+}
+\item El algoritmo termina cuando las búsquedas se encuentran a la mitad del camino.
+\note<4>{
+Cada dirección de exploración tiene una frontera de búsqueda. 
+
+El objetivo de cada exploración es descubrir un estado que es común a las dos fronteras.
+
+Cuando dicha intersección se encuentra se puede conformar la ruta total a partir de las rutas parciales al estado común.
+}
+
+\end{itemize}
+\end{block}
+\end{frame}
+
+\begin{frame}
+\frametitle{Búsqueda bidireccional}
+\only<1>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-10.pdf}
+\end{center}
+}
+\note<1>{
+El estado inicial se agrega a la frontera de la búsqueda progresiva.
+
+El estado meta se agrega a la frontera de la búsqueda regresiva.
+}
+
+
+\only<2>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-09.pdf}
+\end{center}
+}
+\note<2>{
+La búsqueda progresiva expande el nodo inicial.
+
+La nueva frontera son todos los estados a profundidad 1.
+
+La búsqueda progresiva busca que su frontera se intersecte con la frontera de la búsqueda regresiva.
+
+Esto no ha pasado aún.
+}
+
+\only<3>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-08.pdf}
+\end{center}
+}
+\note<3>{
+Ahora es el turno de la búsqueda regresiva.
+
+Si hacemos las búsquedas por turnos garantizamos que al intersectarse las fronteras, tendremos la solución óptima.
+
+La búsqueda regresiva expande el estado meta.
+}
+
+\only<4>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-07.pdf}
+\end{center}
+}
+
+\note<4>{
+Turno de la búsqueda progresiva.
+
+Generamos la frontera actual.
+
+Todos los sucesores de los estados de la frontera anterior.
+}
+
+\only<5>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-06.pdf}
+\end{center}
+}
+\note<5>{
+Ahora es el turno de la búsqueda regresiva.
+
+Agregamos todos los estados a profundidad 2.
+
+Aún no se intersectan las fronteras.
+}
+
+\only<6>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-05.pdf}
+\end{center}
+}
+
+\note<6>{
+Hacia adelante con profundidad 3.
+}
+
+\only<7>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-04.pdf}
+\end{center}
+}
+
+\note<7>{
+Hacia atrás con profundidad 3.
+}
+
+\only<8>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-03.pdf}
+\end{center}
+}
+\note<8>{
+Se alcanza profundidad 4 en la búsqueda progresiva.
+
+No hay intersección todavía.
+}
+
+\only<9>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-02.pdf}
+\end{center}
+}
+
+\note<9>{
+La búsqueda regresiva también alcanza profundidad 4.
+
+Sin intersección.
+}
+
+\only<10>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-01.pdf}
+\end{center}
+}
+\note<10>{
+
+Turno de la búsqueda hacia adelante.
+
+No mostramos todos los nodos a profundidad 5.
+
+Únicamente el nodo de intersección entre las dos fronteras.
+
+}
+
+\only<11>{
+\begin{center}
+\includegraphics[scale=0.13]{bidireccional-diagrama-00.pdf}
+\end{center}
+}
+
+\note<11>{
+
+Considerando que la intersección se encuentra tras expandir todos los estados a profundidad 5 en la frontera de la búsqueda progresiva, 
+
+y sumando el total de estados expandidos con el total de ambas fronteras, 
+
+tenemos que hemos expandido poco menos de 500 estados.
+
+Dado que en este ejemplo la solución esta a profundidad 9,
+
+un algoritmo BFS convencional habría expandido cerca de 30 mil estados para encontrar la solución.
+
+Esto es un ahorro significativo en memoria.
+
+}
+
+\end{frame}
+
+\begin{frame}
+\frametitle{Algoritmo Bidireccional}
+\begin{center}
+\includegraphics[scale=0.10]{pizarron.jpg}
+\end{center}
+\note{
+Explicamos el algoritmo Bidireccional en el pizarrón.
+}
+\end{frame}
+
+\begin{frame}
+\frametitle{Análisis Asintótico del algoritmo Bidireccional}
+\begin{center}
+\includegraphics[scale=0.35]{analisis-bidireccional.pdf}
+\end{center}
+\end{frame}
+
+\note{
+El desempeño del algoritmo bidireccional es muy bueno.
+
+A pesar de utilizar memoria exponencial, al dividirse la búsqueda en dos exploraciones por turnos, el crecimiento de memoria es $O(b^{d/2})$.
+
+Este ahorro es sustancial.
+
+Respecto del tiempo, crece a la par con la memoria.
+
+El algoritmo nos da la solución óptima,
+
+y es completo.
+
+Para problemas grandes, aún este ahorro de memoria, puede no ser suficiente.
+
+La desventaja más notable es que el algoritmo no es tan general como los otros.
+
+Se requiere de conocer el estado meta y también de poder ir hacia atrás de los estados para recuperar los estados predecesores.
+}
+
+\end{document}
\ No newline at end of file

curso-search/bidireccional.log

-This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex 2017.8.31)  25 SEP 2018 13:35
+This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex 2018.11.8)  9 FEB 2019 17:36
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
@@ -1492,7 +1492,7 @@ Package atveryend Info: Empty hook `AtVeryVeryEnd' on input line 275.
 Here is how much of TeX's memory you used:
  20872 strings out of 493029
  411365 string characters out of 6136234
- 518128 words of memory out of 5000000
+ 518127 words of memory out of 5000000
  23866 multiletter control sequences out of 15000+600000
  8452 words of font info for 32 fonts, out of 8000000 for 9000
  1141 hyphenation exceptions out of 8191
@@ -1505,7 +1505,7 @@ dist/fonts/type1/public/amsfonts/cm/cmss10.pfb></usr/share/texlive/texmf-dist/f
 onts/type1/public/amsfonts/cm/cmss12.pfb></usr/share/texlive/texmf-dist/fonts/t
 ype1/public/amsfonts/cm/cmss8.pfb></usr/share/texlive/texmf-dist/fonts/type1/pu
 blic/amsfonts/cm/cmss9.pfb>
-Output written on bidireccional.pdf (18 pages, 3498472 bytes).
+Output written on bidireccional.pdf (18 pages, 3498176 bytes).
 PDF statistics:
  25144 PDF objects out of 26593 (max. 8388607)
  16797 compressed objects within 168 object streams

curso-search/bidireccional.tex.bak

@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/búsqueda-informada.aux

-\relax 
+\relax 
@@ -38,10 +38,10 @@
 \@writefile{nav}{\headcommand {\beamer@framepages {13}{14}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{6}{15/15}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {15}{15}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{7}{16/16}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {16}{16}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{16}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{16}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{16}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {16}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {7}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{7}{16/16}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {16}{16}}}

curso-search/búsqueda-informada.nav

-\beamer@endinputifotherversion {3.36pt}
+\beamer@endinputifotherversion {3.36pt}
@@ -11,10 +11,10 @@
 \headcommand {\beamer@framepages {13}{14}}
 \headcommand {\slideentry {0}{0}{6}{15/15}{}{0}}
 \headcommand {\beamer@framepages {15}{15}}
+\headcommand {\slideentry {0}{0}{7}{16/16}{}{0}}
+\headcommand {\beamer@framepages {16}{16}}
 \headcommand {\beamer@partpages {1}{16}}
 \headcommand {\beamer@subsectionpages {1}{16}}
 \headcommand {\beamer@sectionpages {1}{16}}
 \headcommand {\beamer@documentpages {16}}
 \headcommand {\def \inserttotalframenumber {7}}
-\headcommand {\slideentry {0}{0}{7}{16/16}{}{0}}
-\headcommand {\beamer@framepages {16}{16}}

curso-search/búsqueda-informada.tex

-\documentclass[xcolor=dvipsnames]{beamer}
+\documentclass[xcolor=dvipsnames]{beamer}
@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/dfs.aux

+\relax 
+\providecommand\hyper@newdestlabel[2]{}
+\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
+\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
+\global\let\oldcontentsline\contentsline
+\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
+\global\let\oldnewlabel\newlabel
+\gdef\newlabel#1#2{\newlabelxx{#1}#2}
+\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
+\AtEndDocument{\ifx\hyper@anchor\@undefined
+\let\contentsline\oldcontentsline
+\let\newlabel\oldnewlabel
+\fi}
+\fi}
+\global\let\hyper@last\relax 
+\gdef\HyperFirstAtBeginDocument#1{#1}
+\providecommand\HyField@AuxAddToFields[1]{}
+\providecommand\HyField@AuxAddToCoFields[2]{}
+\catcode `"\active 
+\catcode `<\active 
+\catcode `>\active 
+\@nameuse{es@quoting}
+\@writefile{toc}{\beamer@endinputifotherversion {3.36pt}}
+\@writefile{nav}{\beamer@endinputifotherversion {3.36pt}}
+\select@language{spanish}
+\@writefile{toc}{\select@language{spanish}}
+\@writefile{lof}{\select@language{spanish}}
+\@writefile{lot}{\select@language{spanish}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{1}{1/1}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {1}{1}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{2}{2/15}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {2}{15}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{3}{16/16}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {16}{16}}}
+\@writefile{nav}{\headcommand {\beamer@partpages {1}{37}}}
+\@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{37}}}
+\@writefile{nav}{\headcommand {\beamer@sectionpages {1}{37}}}
+\@writefile{nav}{\headcommand {\beamer@documentpages {37}}}
+\@writefile{nav}{\headcommand {\def \inserttotalframenumber {4}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{4}{17/37}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {17}{37}}}

curso-search/dfs.nav

+\beamer@endinputifotherversion {3.36pt}
+\headcommand {\slideentry {0}{0}{1}{1/1}{}{0}}
+\headcommand {\beamer@framepages {1}{1}}
+\headcommand {\slideentry {0}{0}{2}{2/15}{}{0}}
+\headcommand {\beamer@framepages {2}{15}}
+\headcommand {\slideentry {0}{0}{3}{16/16}{}{0}}
+\headcommand {\beamer@framepages {16}{16}}
+\headcommand {\beamer@partpages {1}{37}}
+\headcommand {\beamer@subsectionpages {1}{37}}
+\headcommand {\beamer@sectionpages {1}{37}}
+\headcommand {\beamer@documentpages {37}}
+\headcommand {\def \inserttotalframenumber {4}}
+\headcommand {\slideentry {0}{0}{4}{17/37}{}{0}}
+\headcommand {\beamer@framepages {17}{37}}

curso-search/dfs.tex

@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-%\setbeameroption{show notes on second screen=right}
+\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/dfs.toc

+\beamer@endinputifotherversion {3.36pt}
+\select@language {spanish}

curso-search/geneticos/ga-permutacion.aux

@@ -58,10 +58,10 @@
 \@writefile{nav}{\headcommand {\beamer@framepages {21}{21}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{16}{22/22}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {22}{22}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{17}{23/23}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {23}{23}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{23}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{23}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{23}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {23}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {17}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{17}{23/23}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {23}{23}}}

curso-search/geneticos/ga-permutacion.nav

@@ -31,10 +31,10 @@
 \headcommand {\beamer@framepages {21}{21}}
 \headcommand {\slideentry {0}{0}{16}{22/22}{}{0}}
 \headcommand {\beamer@framepages {22}{22}}
+\headcommand {\slideentry {0}{0}{17}{23/23}{}{0}}
+\headcommand {\beamer@framepages {23}{23}}
 \headcommand {\beamer@partpages {1}{23}}
 \headcommand {\beamer@subsectionpages {1}{23}}
 \headcommand {\beamer@sectionpages {1}{23}}
 \headcommand {\beamer@documentpages {23}}
 \headcommand {\def \inserttotalframenumber {17}}
-\headcommand {\slideentry {0}{0}{17}{23/23}{}{0}}
-\headcommand {\beamer@framepages {23}{23}}

curso-search/geneticos/ga-permutacion.tex

@@ -9,7 +9,7 @@
 \usepackage{multicol}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/geneticos/ga-permutacion.tex.bak

@@ -9,7 +9,7 @@
 \usepackage{multicol}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 
@@ -396,9 +396,12 @@ Hacemos la población actual igual a la nueva población.
 
 \begin{frame}
 \frametitle{Comentario final.}
-Cómputo evolutivo, 
+\begin{center}
+\includegraphics[scale=0.5]{logoesp.jpeg}
+\end{center}
+Curso: Cómputo evolutivo, 
 
-dentro de la especialización Introducción a la inteligencia artificial de la UNAM.
+Especialización: Introducción a la inteligencia artificial de la UNAM.
 \note{
 
 Los algoritmos genéticos son metaheurísticos muy poderosos.

curso-search/heuristicas-diseño.aux

-\relax 
+\relax 
@@ -36,10 +36,10 @@
 \@writefile{nav}{\headcommand {\beamer@framepages {4}{18}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{5}{19/25}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {19}{25}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{6}{26/30}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {26}{30}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{30}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{30}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{30}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {30}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {6}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{6}{26/30}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {26}{30}}}

curso-search/heuristicas-diseño.nav

-\beamer@endinputifotherversion {3.36pt}
+\beamer@endinputifotherversion {3.36pt}
@@ -9,10 +9,10 @@
 \headcommand {\beamer@framepages {4}{18}}
 \headcommand {\slideentry {0}{0}{5}{19/25}{}{0}}
 \headcommand {\beamer@framepages {19}{25}}
+\headcommand {\slideentry {0}{0}{6}{26/30}{}{0}}
+\headcommand {\beamer@framepages {26}{30}}
 \headcommand {\beamer@partpages {1}{30}}
 \headcommand {\beamer@subsectionpages {1}{30}}
 \headcommand {\beamer@sectionpages {1}{30}}
 \headcommand {\beamer@documentpages {30}}
 \headcommand {\def \inserttotalframenumber {6}}
-\headcommand {\slideentry {0}{0}{6}{26/30}{}{0}}
-\headcommand {\beamer@framepages {26}{30}}

curso-search/heuristicas-diseño.tex

-\documentclass[xcolor=dvipsnames]{beamer}
+\documentclass[xcolor=dvipsnames]{beamer}
@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/heuristicas-diseño.tex.bak

-\documentclass[xcolor=dvipsnames]{beamer}
+\documentclass[xcolor=dvipsnames]{beamer}
@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/mejorando-Astar.aux

@@ -38,10 +38,10 @@
 \@writefile{nav}{\headcommand {\beamer@framepages {14}{17}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{6}{18/21}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {18}{21}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{7}{22/45}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {22}{45}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{45}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{45}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{45}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {45}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {7}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{7}{22/45}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {22}{45}}}

curso-search/mejorando-Astar.nav

@@ -11,10 +11,10 @@
 \headcommand {\beamer@framepages {14}{17}}
 \headcommand {\slideentry {0}{0}{6}{18/21}{}{0}}
 \headcommand {\beamer@framepages {18}{21}}
+\headcommand {\slideentry {0}{0}{7}{22/45}{}{0}}
+\headcommand {\beamer@framepages {22}{45}}
 \headcommand {\beamer@partpages {1}{45}}
 \headcommand {\beamer@subsectionpages {1}{45}}
 \headcommand {\beamer@sectionpages {1}{45}}
 \headcommand {\beamer@documentpages {45}}
 \headcommand {\def \inserttotalframenumber {7}}
-\headcommand {\slideentry {0}{0}{7}{22/45}{}{0}}
-\headcommand {\beamer@framepages {22}{45}}

curso-search/mejorando-Astar.tex

@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/mejorando-Astar.tex.bak

@@ -6,7 +6,7 @@
 \usepackage[makeroom]{cancel}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 
@@ -498,6 +498,8 @@ $J$ será el siguiente en salir.
 Evaluamos cuando debemos agregar a $D$ a la agenda, pues ya se había expandido antes y esta en la tabla con un costo de 1206.
 
 Su costo acumulado es de 1357. Significa que esta ruta es peor que la anterior y sería infructuoso expandirlo nuevamente.
+
+El siguiente nodo a sacar es $L$.
 }
 
 \only<19>{
@@ -505,42 +507,73 @@ Su costo acumulado es de 1357. Significa que esta ruta es peor que la anterior y
 \includegraphics[scale=0.30]{BBAstar-ejemplo-19.pdf}
 \end{center}
 }
-\note<19>{}
+\note<19>{
+$T$ su sucesor, también supera la cota de costo.
+
+Lo ignoramos.
+}
 
 \only<20>{
 \begin{center}
 \includegraphics[scale=0.30]{BBAstar-ejemplo-20.pdf}
 \end{center}
 }
-\note<20>{}
+\note<20>{
+Es el turno de $V$.
+
+No agrega nada.
+}
 
 \only<21>{
 \begin{center}
 \includegraphics[scale=0.30]{BBAstar-ejemplo-21.pdf}
 \end{center}
 }
-\note<21>{}
+\note<21>{
+El siguiente al frente es $R$.
+}
 
 \only<22>{
 \begin{center}
 \includegraphics[scale=0.30]{BBAstar-ejemplo-22.pdf}
 \end{center}
 }
-\note<22>{}
+\note<22>{
+Su sucesor, el estado $U$, tiene un costo acumulado que supera la cota.
+
+Lo ignoramos también.
+
+}
 
 \only<23>{
 \begin{center}
 \includegraphics[scale=0.30]{BBAstar-ejemplo-23.pdf}
 \end{center}
 }
-\note<23>{}
+\note<23>{
+Queda otra instancia del nodo $R$ en la agenda.
+
+La sacamos.
+
+Su costo acumulado de 1391 esta dentro de la cota.
+
+Sin embargo ya se había expandido una $R$ a un costo de 1149.
+
+Como esta segunda ruta a $R$, tiene un costo superior, no vamos a expandir el nodo.
+}
 
 \only<24>{
 \begin{center}
 \includegraphics[scale=0.30]{BBAstar-ejemplo-24.pdf}
 \end{center}
 }
-\note<24>{}
+\note<24>{
+La agenda se ha vaciado.
+
+Regresamos la mejor ruta encontrada.
+
+En este caso la $\text{ruta}_2$.
+}
 
 \end{frame}
 

curso-search/metaheuristicas-intro.aux

@@ -61,10 +61,10 @@
 \@writefile{nav}{\headcommand {\beamer@framepages {21}{22}}}
 \@writefile{nav}{\headcommand {\slideentry {0}{0}{17}{23/23}{}{0}}}
 \@writefile{nav}{\headcommand {\beamer@framepages {23}{23}}}
+\@writefile{nav}{\headcommand {\slideentry {0}{0}{18}{24/24}{}{0}}}
+\@writefile{nav}{\headcommand {\beamer@framepages {24}{24}}}
 \@writefile{nav}{\headcommand {\beamer@partpages {1}{24}}}
 \@writefile{nav}{\headcommand {\beamer@subsectionpages {1}{24}}}
 \@writefile{nav}{\headcommand {\beamer@sectionpages {1}{24}}}
 \@writefile{nav}{\headcommand {\beamer@documentpages {24}}}
 \@writefile{nav}{\headcommand {\def \inserttotalframenumber {18}}}
-\@writefile{nav}{\headcommand {\slideentry {0}{0}{18}{24/24}{}{0}}}
-\@writefile{nav}{\headcommand {\beamer@framepages {24}{24}}}

curso-search/metaheuristicas-intro.nav

@@ -33,10 +33,10 @@
 \headcommand {\beamer@framepages {21}{22}}
 \headcommand {\slideentry {0}{0}{17}{23/23}{}{0}}
 \headcommand {\beamer@framepages {23}{23}}
+\headcommand {\slideentry {0}{0}{18}{24/24}{}{0}}
+\headcommand {\beamer@framepages {24}{24}}
 \headcommand {\beamer@partpages {1}{24}}
 \headcommand {\beamer@subsectionpages {1}{24}}
 \headcommand {\beamer@sectionpages {1}{24}}
 \headcommand {\beamer@documentpages {24}}
 \headcommand {\def \inserttotalframenumber {18}}
-\headcommand {\slideentry {0}{0}{18}{24/24}{}{0}}
-\headcommand {\beamer@framepages {24}{24}}

curso-search/metaheuristicas-intro.tex

@@ -9,7 +9,7 @@
 \usepackage{multicol}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 

curso-search/metaheuristicas-intro.tex.bak

@@ -9,7 +9,7 @@
 \usepackage{multicol}
 
 % descomentar para generar handouts con notas
-\setbeameroption{show notes on second screen=right}
+%\setbeameroption{show notes on second screen=right}
 \usepackage{tikz}
 \tikzstyle{every picture}+=[remember picture]
 
@@ -490,7 +490,7 @@ Los algoritmos metaheurísticos tienen un espíritu pragmático y generalmente comb
 
 Frecuentemente la fuente de inspiración para diseñar dichas estrategias es la naturaleza. Como es el caso del algortimo SA que hemos visto hoy.
 
-Una técnica muy frecuentemente utilizada en la práctica es la hibridación o combinación de estrategias. Por ejemplo con los algoritmos denominados \emph{meméticos} que combinan la evolución de una población de soluciones con aprendizaje individual.
+Una estrategia frecuentemente utilizada en la práctica es la hibridación o combinación de algoritmos. Por ejemplo, los algoritmos denominados \emph{meméticos} combinan la evolución de una población de soluciones con aprendizaje individual.
 }
 
 \begin{frame}

curso-search/python/modulo2parte1.txt

+nodo = agenda.popleft()

curso-search/python/modulo2parte2.txt

+nodo = agenda.pop()

curso-search/python/modulo2parte3.txt

+ruta de 15 pasos
+ruta de 13 pasos
+ruta de 11 pasos
+ruta de 3 pasos
+1498283608542054070514982825777499030305149826443580804472651147797409030816545
+longitud de ruta: 3

curso-search/python/modulo2parte4.txt

+...--......----........
+18153385203914326785181533852039122296651815338520381785782518153377507353903905173607560675646021451147797409030816545
+longitud de ruta: 5

curso-search/python/modulo3parte1.txt

+716494

curso-search/python/modulo3parte2.txt

+9786798949092152051072643215642266691029596919957779786798949092152051072643215643965696725342962907773033916553892309907350155917073978905998706443936757303391655389230990735015591707769312862926890601074717094307133832578328183999897981095023685181114587571709434938328624628802785432060007948471052140770747166369594659090185935481315522842586763536171030753516636959465909018593548131552252144884618549025634441675180993703681592608124518968098266003131072804333167518099370368159260812451896943839974259071411222219791763957992042517593017013717597723153222863361114175718957568096904335078211427676043893830320128000

curso-search/python/regexp.parte3.txt

+(?m)(.*$)*\s*ruta\sde\s15\spasos\s$\sruta\sde\s13\spasos\s$\sruta\sde\s11\spasos\s$\sruta\sde\s3\spasos\s*(.*$)*

curso-search/python/regexp.parte4.txt

+(?m)(.*$)\s*\.\.\.\-\-\.\.\.\.\.\.\-\-\-\-\.\.\.\.\.\.\.\.(.*$)*\[(.*$)*\s*1\s*0\s*3\s*4(.*$)*\s*5\s*2\s*6\s*8(.*$)*\s*9\s*a\s*7\s*c(.*$)*\s*d\s*e\s*b\s*f(.*$)*(.*$)*,\s*(.*$)*\s*1\s*2\s*3\s*4(.*$)*\s*5\s*0\s*6\s*8(.*$)*\s*9\s*a\s*7\s*c(.*$)*\s*d\s*e\s*b\s*f(.*$)*(.*$)*,\s*(.*$)*\s*1\s*2\s*3\s*4(.*$)*\s*5\s*6\s*0\s*8(.*$)*\s*9\s*a\s*7\s*c(.*$)*\s*d\s*e\s*b\s*f(.*$)*(.*$)*,\s*(.*$)*\s*1\s*2\s*3\s*4(.*$)*\s*5\s*6\s*7\s*8(.*$)*\s*9\s*a\s*0\s*c(.*$)*\s*d\s*e\s*b\s*f(.*$)*(.*$)*,\s*(.*$)*\s*1\s*2\s*3\s*4(.*$)*\s*5\s*6\s*7\s*8(.*$)*\s*9\s*a\s*b\s*c(.*$)*\s*d\s*e\s*0\s*f(.*$)*(.*$)*,\s*(.*$)*\s*1\s*2\s*3\s*4(.*$)*\s*5\s*6\s*7\s*8(.*$)*\s*9\s*a\s*b\s*c(.*$)*\s*d\s*e\s*f\s*0(.*$)*(.*$)*\](.*$)*longitud\s*de\s*ruta:\s*5\s*(.*$)*

curso-search/referencias/referencias.bib

+@book{russell2009,
+  title={Artificial intelligence: A modern approach (3rd or 2nd Edition)},
+  author={Russell, Stuart and Norvig, Peter},
+  year={2009},
+  publisher={Prentice Hall},
+  note ={El libro de referencia del curso. Cubre prácticamente todos los temas a tratar}
+}
+
+@book{pearl1984,
+  title={Heuristics: intelligent search strategies for computer problem solving},
+  author={Pearl, Judea},
+  year={1984},
+  publisher={Addison-Wesley Pub. Co., Inc., Reading, MA},
+  note ={Cubre el tema de resolución de problemas. Búsquedas informadas}
+}
+
+@book{heineman2016algorithms,
+  title={Algorithms in a nutshell: a practical guide},
+  author={Heineman, George T and Pollice, Gary and Selkow, Stanley},
+  year={2016},
+  publisher={" O'Reilly Media, Inc."}
+}
+
+@book{ertel2018introduction,
+  title={Introduction to artificial intelligence},
+  author={Ertel, Wolfgang},
+  year={2018},
+  publisher={Springer}
+}
+
+@book{michalewicz2013solve,
+  title={How to solve it: modern heuristics},
+  author={Michalewicz, Zbigniew and Fogel, David B},
+  year={2013},
+  publisher={Springer Science \& Business Media}
+}
+
+@book{goldberg1989,
+  title={Genetic algorithms in search, optimization, and machine learning},
+  author={Goldberg, David Edward and others},
+  volume={412},
+  year={1989},
+  publisher={Addison-wesley Reading Menlo Park},
+  note = {Cubre el tema de algoritmos genéticos}
+}
+
+@book{nilsson2010,
+  title={The quest for artificial intelligence},
+  author={Nilsson, Nils J},
+  year={2010},
+  publisher={Cambridge University Press},
+  note = {Discute extensivamente el área de Inteligencia Artificial mostrando su evolución histórica y aplicaciones. \url{http://ai.stanford.edu/~nilsson/QAI/qai.pdf}}
+}
+
+@inproceedings{berliner1985study,
+  title={A study of search methods: the effect of constraint satisfaction and adventurousness},
+  author={Berliner, Hans and Goetsch, Gordon},
+  booktitle={Proceedings of the 9th international joint conference on Artificial intelligence-Volume 2},
+  pages={1079--1082},
+  year={1985},
+  organization={Morgan Kaufmann Publishers Inc.}
+}
+
+@article{burns2010best,
+  title={Best-first heuristic search for multicore machines},
+  author={Burns, Ethan and Lemons, Sofia and Ruml, Wheeler and Zhou, Rong},
+  journal={Journal of Artificial Intelligence Research},
+  volume={39},
+  pages={689--743},
+  year={2010}
+}
+
+
+
+@article{zhou2006breadth,
+  title={Breadth-first heuristic search},
+  author={Zhou, Rong and Hansen, Eric A},
+  journal={Artificial Intelligence},
+  volume={170},
+  number={4},
+  pages={385--408},
+  year={2006}
+}
+
+@inproceedings{holte2010common,
+  title={Common misconceptions concerning heuristic search},
+  author={Holte, Robert C},
+  booktitle={Third Annual Symposium on Combinatorial Search},
+  year={2010}
+}
+
+@inproceedings{zhang2000depth,
+  title={Depth-first branch-and-bound versus local search: A case study},
+  author={Zhang, Weixiong},
+  booktitle={AAAI/IAAI},
+  pages={930--935},
+  year={2000}
+}
+
+@inproceedings{zhang1993depth,
+  title={Depth-first vs. best-first search: New results},
+  author={Zhang, Weixiong and Korf, Richard E},
+  booktitle={AAAI},
+  pages={769--775},
+  year={1993}
+}
+
+@article{korf1990depth,
+  title={Depth-limited search for real-time problem solving},
+  author={Korf, Richard E},
+  journal={Real-Time Systems},
+  volume={2},
+  number={1-2},
+  pages={7--24},
+  year={1990},
+  publisher={Springer}
+}
+
+@inproceedings{korf2000divide,
+  title={Divide-and-conquer frontier search applied to optimal sequence alignment},
+  author={Korf, Richard E and Zhang, Weixiong},
+  booktitle={AAAI/IAAI},
+  pages={910--916},
+  year={2000}
+}
+
+@article{reinefeld1994enhanced,
+  title={Enhanced iterative-deepening search},
+  author={Reinefeld, Alexander and Marsland, T. Anthony},
+  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
+  volume={16},
+  number={7},
+  pages={701--710},
+  year={1994},
+  publisher={IEEE}
+}
+
+@inproceedings{korf1997finding,
+  title={Finding optimal solutions to Rubik's cube using pattern databases},
+  author={Korf, Richard E},
+  booktitle={AAAI/IAAI},
+  pages={700--705},
+  year={1997}
+}
+
+@inproceedings{korf1996finding,
+  title={Finding optimal solutions to the twenty-four puzzle},
+  author={Korf, Richard E and Taylor, Larry A},
+  booktitle={Proceedings of the national conference on artificial intelligence},
+  pages={1202--1207},
+  year={1996}
+}
+
+@article{korf2005frontier,
+  title={Frontier search},
+  author={Korf, Richard E and Zhang, Weixiong and Thayer, Ignacio and Hohwald, Heath},
+  journal={Journal of the ACM (JACM)},
+  volume={52},
+  number={5},
+  pages={715--748},
+  year={2005},
+  publisher={ACM}
+}
+
+@article{gendron1994parallel,
+  title={Parallel branch-and-branch algorithms: Survey and synthesis},
+  author={Gendron, Bernard and Crainic, Teodor Gabriel},
+  journal={Operations research},
+  volume={42},
+  number={6},
+  pages={1042--1066},
+  year={1994},
+  publisher={INFORMS}
+}
+
+@inproceedings{kaindl1995use,
+  title={How to use limited memory in heuristic search},
+  author={Kaindl, Hermann and Kainz, Gerhard and Leeb, Angelika and Smetana, Harald},
+  booktitle={IJCAI},
+  pages={236--242},
+  year={1995}
+}
+
+@inproceedings{ochoa2012hyflex,
+  title={Hyflex: A benchmark framework for cross-domain heuristic search},
+  author={Ochoa, Gabriela and Hyde, Matthew and Curtois, Tim and Vazquez-Rodriguez, Jose A and Walker, James and Gendreau, Michel and Kendall, Graham and McCollum, Barry and Parkes, Andrew J and Petrovic, Sanja and others},
+  booktitle={European Conference on Evolutionary Computation in Combinatorial Optimization},
+  pages={136--147},
+  year={2012},
+  organization={Springer}
+}
+
+@inproceedings{korf1996improved,
+  title={Improved limited discrepancy search},
+  author={Korf, Richard E},
+  booktitle={AAAI/IAAI, Vol. 1},
+  pages={286--291},
+  year={1996}
+}
+
+@article{harikumar1996iterative,
+  title={Iterative deepening multiobjective},
+  author={Harikumar, S and Kumar, Shashi},
+  journal={Information Processing Letters},
+  volume={58},
+  pages={11--15},
+  year={1996},
+  publisher={Elsevier Science}
+}
+
+@article{korf1985depth,
+  title={Depth-first iterative-deepening: An optimal admissible tree search},
+  author={Korf, Richard E},
+  journal={Artificial intelligence},
+  volume={27},
+  number={1},
+  pages={97--109},
+  year={1985},
+  publisher={Elsevier}
+}
+
+@article{korf1993linear,
+  title={Linear-space best-first search},
+  author={Korf, Richard E},
+  journal={Artificial Intelligence},
+  volume={62},
+  number={1},
+  pages={41--78},
+  year={1993},
+  publisher={Elsevier}
+}
+
+@article{prieditis1993machine,
+  title={Machine discovery of effective admissible heuristics},
+  author={Prieditis, Armand E},
+  journal={Machine learning},
+  volume={12},
+  number={1-3},
+  pages={117--141},
+  year={1993},
+  publisher={Springer}
+}
+
+@article{holte2006maximizing,
+  title={Maximizing over multiple pattern databases speeds up heuristic search},
+  author={Holte, Robert C and Felner, Ariel and Newton, Jack and Meshulam, Ram and Furcy, David},
+  journal={Artificial Intelligence},
+  volume={170},
+  number={16-17},
+  pages={1123--1136},
+  year={2006},
+  publisher={Elsevier}
+}
+
+@inproceedings{zhou2002memory,
+  title={Memory-Bounded A* Graph Search.},
+  author={Zhou, Rong and Hansen, Eric A},
+  booktitle={FLAIRS conference},
+  pages={203--209},
+  year={2002}
+}
+
+@inproceedings{kaindl1994memory,
+  title={Memory-bounded bidirectional search},
+  author={Kaindl, Hermann and Khorsand, Aliasghar},
+  booktitle={AAAI},
+  pages={1359--1364},
+  year={1994}
+}
+
+@article{culberson1998pattern,
+  title={Pattern databases},
+  author={Culberson, Joseph C and Schaeffer, Jonathan},
+  journal={Computational Intelligence},
+  volume={14},
+  number={3},
+  pages={318--334},
+  year={1998},
+  publisher={Wiley Online Library}
+}
+
+@article{dillenburg1994perimeter,
+  title={Perimeter search},
+  author={Dillenburg, John F and Nelson, Peter C},
+  journal={Artificial Intelligence},
+  volume={65},
+  number={1},
+  pages={165--178},
+  year={1994},
+  publisher={Elsevier}
+}
+
+@article{korf2001time,
+  title={Time complexity of iterative-deepening-A*},
+  author={Korf, Richard E and Reid, Michael and Edelkamp, Stefan},
+  journal={Artificial Intelligence},
+  volume={129},
+  number={1-2},
+  pages={199--218},
+  year={2001},
+  publisher={Elsevier}
+}
+
+@book{rubik1987rubik,
+  title={Rubik's cubic compendium},
+  author={Rubik, Ern{\"o}},
+  volume={3},
+  year={1987},
+  publisher={Oxford University Press, USA}
+}
+
+@article{mcaleer2018solving,
+  title={Solving the Rubik's Cube Without Human Knowledge},
+  author={McAleer, Stephen and Agostinelli, Forest and Shmakov, Alexander and Baldi, Pierre},
+  journal={arXiv preprint arXiv:1805.07470},
+  year={2018}
+}
+
+@article{arfaee2011learning,
+  title={Learning heuristic functions for large state spaces.},
+  author={Arfaee, Shahab Jabbari and Zilles, Sandra and Holte, Robert C},
+  journal={Artif. Intell.},
+  volume={175},
+  number={16-17},
+  pages={2075--2098},
+  year={2011},
+  publisher={Citeseer}
+}
+
+@article{kirkpatrick1983optimization,
+  title={Optimization by simulated annealing},
+  author={Kirkpatrick, Scott and Gelatt, C Daniel and Vecchi, Mario P},
+  journal={science},
+  volume={220},
+  number={4598},
+  pages={671--680},
+  year={1983},
+  publisher={American Association for the Advancement of Science}
+}
+
+

curso-search/referencias/referencias.bib.bak

+@book{russell2009,
+  title={Artificial intelligence: A modern approach (3rd or 2nd Edition)},
+  author={Russell, Stuart and Norvig, Peter},
+  year={2009},
+  publisher={Prentice Hall},
+  note ={El libro de referencia del curso. Cubre prácticamente todos los temas a tratar}
+}
+
+@book{pearl1984,
+  title={Heuristics: intelligent search strategies for computer problem solving},
+  author={Pearl, Judea},
+  year={1984},
+  publisher={Addison-Wesley Pub. Co., Inc., Reading, MA},
+  note ={Cubre el tema de resolución de problemas. Búsquedas informadas}
+}
+
+@book{heineman2016algorithms,
+  title={Algorithms in a nutshell: a practical guide},
+  author={Heineman, George T and Pollice, Gary and Selkow, Stanley},
+  year={2016},
+  publisher={" O'Reilly Media, Inc."}
+}
+
+@book{ertel2018introduction,
+  title={Introduction to artificial intelligence},
+  author={Ertel, Wolfgang},
+  year={2018},
+  publisher={Springer}
+}
+
+@book{michalewicz2013solve,
+  title={How to solve it: modern heuristics},
+  author={Michalewicz, Zbigniew and Fogel, David B},
+  year={2013},
+  publisher={Springer Science \& Business Media}
+}
+
+@book{goldberg1989,
+  title={Genetic algorithms in search, optimization, and machine learning},
+  author={Goldberg, David Edward and others},
+  volume={412},
+  year={1989},
+  publisher={Addison-wesley Reading Menlo Park},
+  note = {Cubre el tema de algoritmos genéticos}
+}
+
+@book{nilsson2010,
+  title={The quest for artificial intelligence},
+  author={Nilsson, Nils J},
+  year={2010},
+  publisher={Cambridge University Press},
+  note = {Discute extensivamente el área de Inteligencia Artificial mostrando su evolución histórica y aplicaciones. \url{http://ai.stanford.edu/~nilsson/QAI/qai.pdf}}
+}
+
+@inproceedings{berliner1985study,
+  title={A study of search methods: the effect of constraint satisfaction and adventurousness},
+  author={Berliner, Hans and Goetsch, Gordon},
+  booktitle={Proceedings of the 9th international joint conference on Artificial intelligence-Volume 2},
+  pages={1079--1082},
+  year={1985},
+  organization={Morgan Kaufmann Publishers Inc.}
+}
+
+@article{burns2010best,
+  title={Best-first heuristic search for multicore machines},
+  author={Burns, Ethan and Lemons, Sofia and Ruml, Wheeler and Zhou, Rong},
+  journal={Journal of Artificial Intelligence Research},
+  volume={39},
+  pages={689--743},
+  year={2010}
+}
+
+
+
+@article{zhou2006breadth,
+  title={Breadth-first heuristic search},
+  author={Zhou, Rong and Hansen, Eric A},
+  journal={Artificial Intelligence},
+  volume={170},
+  number={4},
+  pages={385--408},
+  year={2006}
+}
+
+@inproceedings{holte2010common,
+  title={Common misconceptions concerning heuristic search},
+  author={Holte, Robert C},
+  booktitle={Third Annual Symposium on Combinatorial Search},
+  year={2010}
+}
+
+@inproceedings{zhang2000depth,
+  title={Depth-first branch-and-bound versus local search: A case study},
+  author={Zhang, Weixiong},
+  booktitle={AAAI/IAAI},
+  pages={930--935},
+  year={2000}
+}
+
+@inproceedings{zhang1993depth,
+  title={Depth-first vs. best-first search: New results},
+  author={Zhang, Weixiong and Korf, Richard E},
+  booktitle={AAAI},
+  pages={769--775},
+  year={1993}
+}
+
+@article{korf1990depth,
+  title={Depth-limited search for real-time problem solving},
+  author={Korf, Richard E},
+  journal={Real-Time Systems},
+  volume={2},
+  number={1-2},
+  pages={7--24},
+  year={1990},
+  publisher={Springer}
+}
+
+@inproceedings{korf2000divide,
+  title={Divide-and-conquer frontier search applied to optimal sequence alignment},
+  author={Korf, Richard E and Zhang, Weixiong},
+  booktitle={AAAI/IAAI},
+  pages={910--916},
+  year={2000}
+}
+
+@article{reinefeld1994enhanced,
+  title={Enhanced iterative-deepening search},
+  author={Reinefeld, Alexander and Marsland, T. Anthony},
+  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
+  volume={16},
+  number={7},
+  pages={701--710},
+  year={1994},
+  publisher={IEEE}
+}
+
+@inproceedings{korf1997finding,
+  title={Finding optimal solutions to Rubik's cube using pattern databases},
+  author={Korf, Richard E},
+  booktitle={AAAI/IAAI},
+  pages={700--705},
+  year={1997}
+}
+
+@inproceedings{korf1996finding,
+  title={Finding optimal solutions to the twenty-four puzzle},
+  author={Korf, Richard E and Taylor, Larry A},
+  booktitle={Proceedings of the national conference on artificial intelligence},
+  pages={1202--1207},
+  year={1996}
+}
+
+@article{korf2005frontier,
+  title={Frontier search},
+  author={Korf, Richard E and Zhang, Weixiong and Thayer, Ignacio and Hohwald, Heath},
+  journal={Journal of the ACM (JACM)},
+  volume={52},
+  number={5},
+  pages={715--748},
+  year={2005},
+  publisher={ACM}
+}
+
+@article{gendron1994parallel,
+  title={Parallel branch-and-branch algorithms: Survey and synthesis},
+  author={Gendron, Bernard and Crainic, Teodor Gabriel},
+  journal={Operations research},
+  volume={42},
+  number={6},
+  pages={1042--1066},
+  year={1994},
+  publisher={INFORMS}
+}
+
+@inproceedings{kaindl1995use,
+  title={How to use limited memory in heuristic search},
+  author={Kaindl, Hermann and Kainz, Gerhard and Leeb, Angelika and Smetana, Harald},
+  booktitle={IJCAI},
+  pages={236--242},
+  year={1995}
+}
+
+@inproceedings{ochoa2012hyflex,
+  title={Hyflex: A benchmark framework for cross-domain heuristic search},
+  author={Ochoa, Gabriela and Hyde, Matthew and Curtois, Tim and Vazquez-Rodriguez, Jose A and Walker, James and Gendreau, Michel and Kendall, Graham and McCollum, Barry and Parkes, Andrew J and Petrovic, Sanja and others},
+  booktitle={European Conference on Evolutionary Computation in Combinatorial Optimization},
+  pages={136--147},
+  year={2012},
+  organization={Springer}
+}
+
+@inproceedings{korf1996improved,
+  title={Improved limited discrepancy search},
+  author={Korf, Richard E},
+  booktitle={AAAI/IAAI, Vol. 1},
+  pages={286--291},
+  year={1996}
+}
+
+@article{harikumar1996iterative,
+  title={Iterative deepening multiobjective},
+  author={Harikumar, S and Kumar, Shashi},
+  journal={Information Processing Letters},
+  volume={58},
+  pages={11--15},
+  year={1996},
+  publisher={Elsevier Science}
+}
+
+@article{korf1985depth,
+  title={Depth-first iterative-deepening: An optimal admissible tree search},
+  author={Korf, Richard E},
+  journal={Artificial intelligence},
+  volume={27},
+  number={1},
+  pages={97--109},
+  year={1985},
+  publisher={Elsevier}
+}
+
+@article{korf1993linear,
+  title={Linear-space best-first search},
+  author={Korf, Richard E},
+  journal={Artificial Intelligence},
+  volume={62},
+  number={1},
+  pages={41--78},
+  year={1993},
+  publisher={Elsevier}
+}
+
+@article{prieditis1993machine,
+  title={Machine discovery of effective admissible heuristics},
+  author={Prieditis, Armand E},
+  journal={Machine learning},
+  volume={12},
+  number={1-3},
+  pages={117--141},
+  year={1993},
+  publisher={Springer}
+}
+
+@article{holte2006maximizing,
+  title={Maximizing over multiple pattern databases speeds up heuristic search},
+  author={Holte, Robert C and Felner, Ariel and Newton, Jack and Meshulam, Ram and Furcy, David},
+  journal={Artificial Intelligence},
+  volume={170},
+  number={16-17},
+  pages={1123--1136},
+  year={2006},
+  publisher={Elsevier}
+}
+
+@inproceedings{zhou2002memory,
+  title={Memory-Bounded A* Graph Search.},
+  author={Zhou, Rong and Hansen, Eric A},
+  booktitle={FLAIRS conference},
+  pages={203--209},
+  year={2002}
+}
+
+@inproceedings{kaindl1994memory,
+  title={Memory-bounded bidirectional search},
+  author={Kaindl, Hermann and Khorsand, Aliasghar},
+  booktitle={AAAI},
+  pages={1359--1364},
+  year={1994}
+}
+
+@article{culberson1998pattern,
+  title={Pattern databases},
+  author={Culberson, Joseph C and Schaeffer, Jonathan},
+  journal={Computational Intelligence},
+  volume={14},
+  number={3},
+  pages={318--334},
+  year={1998},
+  publisher={Wiley Online Library}
+}
+
+@article{dillenburg1994perimeter,
+  title={Perimeter search},
+  author={Dillenburg, John F and Nelson, Peter C},
+  journal={Artificial Intelligence},
+  volume={65},
+  number={1},
+  pages={165--178},
+  year={1994},
+  publisher={Elsevier}
+}
+
+@article{korf2001time,
+  title={Time complexity of iterative-deepening-A*},
+  author={Korf, Richard E and Reid, Michael and Edelkamp, Stefan},
+  journal={Artificial Intelligence},
+  volume={129},
+  number={1-2},
+  pages={199--218},
+  year={2001},
+  publisher={Elsevier}
+}
+
+@book{rubik1987rubik,
+  title={Rubik's cubic compendium},
+  author={Rubik, Ern{\"o}},
+  volume={3},
+  year={1987},
+  publisher={Oxford University Press, USA}
+}
+
+@article{mcaleer2018solving,
+  title={Solving the Rubik's Cube Without Human Knowledge},
+  author={McAleer, Stephen and Agostinelli, Forest and Shmakov, Alexander and Baldi, Pierre},
+  journal={arXiv preprint arXiv:1805.07470},
+  year={2018}
+}
+
+@article{arfaee2011learning,
+  title={Learning heuristic functions for large state spaces.},
+  author={Arfaee, Shahab Jabbari and Zilles, Sandra and Holte, Robert C},
+  journal={Artif. Intell.},
+  volume={175},
+  number={16-17},
+  pages={2075--2098},
+  year={2011},
+  publisher={Citeseer}
+}
+
+
+

curso-search/referencias/refs.aux

+\relax 
+\providecommand\hyper@newdestlabel[2]{}
+\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
+\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
+\global\let\oldcontentsline\contentsline
+\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
+\global\let\oldnewlabel\newlabel
+\gdef\newlabel#1#2{\newlabelxx{#1}#2}
+\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
+\AtEndDocument{\ifx\hyper@anchor\@undefined
+\let\contentsline\oldcontentsline
+\let\newlabel\oldnewlabel
+\fi}
+\fi}
+\global\let\hyper@last\relax 
+\gdef\HyperFirstAtBeginDocument#1{#1}
+\providecommand\HyField@AuxAddToFields[1]{}
+\providecommand\HyField@AuxAddToCoFields[2]{}
+\citation{*}
+\bibstyle{abbrv}
+\bibdata{referencias}
+\bibcite{arfaee2011learning}{1}
+\bibcite{berliner1985study}{2}
+\bibcite{burns2010best}{3}
+\bibcite{culberson1998pattern}{4}
+\bibcite{dillenburg1994perimeter}{5}
+\bibcite{ertel2018introduction}{6}
+\bibcite{gendron1994parallel}{7}
+\bibcite{goldberg1989}{8}
+\bibcite{harikumar1996iterative}{9}
+\bibcite{heineman2016algorithms}{10}
+\bibcite{holte2010common}{11}
+\bibcite{holte2006maximizing}{12}
+\bibcite{kaindl1995use}{13}
+\bibcite{kaindl1994memory}{14}
+\bibcite{kirkpatrick1983optimization}{15}
+\bibcite{korf1985depth}{16}
+\bibcite{korf1990depth}{17}
+\bibcite{korf1993linear}{18}
+\bibcite{korf1996improved}{19}
+\bibcite{korf1997finding}{20}
+\bibcite{korf2001time}{21}
+\bibcite{korf1996finding}{22}
+\bibcite{korf2000divide}{23}
+\bibcite{korf2005frontier}{24}
+\bibcite{mcaleer2018solving}{25}
+\bibcite{michalewicz2013solve}{26}
+\bibcite{nilsson2010}{27}
+\bibcite{ochoa2012hyflex}{28}
+\bibcite{pearl1984}{29}
+\bibcite{prieditis1993machine}{30}
+\bibcite{reinefeld1994enhanced}{31}
+\bibcite{rubik1987rubik}{32}
+\bibcite{russell2009}{33}
+\bibcite{zhang2000depth}{34}
+\bibcite{zhang1993depth}{35}
+\bibcite{zhou2002memory}{36}
+\bibcite{zhou2006breadth}{37}

curso-search/referencias/refs.bbl

+\begin{thebibliography}{10}
+
+\bibitem{arfaee2011learning}
+S.~J. Arfaee, S.~Zilles, and R.~C. Holte.
+\newblock Learning heuristic functions for large state spaces.
+\newblock {\em Artif. Intell.}, 175(16-17):2075--2098, 2011.
+
+\bibitem{berliner1985study}
+H.~Berliner and G.~Goetsch.
+\newblock A study of search methods: the effect of constraint satisfaction and
+  adventurousness.
+\newblock In {\em Proceedings of the 9th international joint conference on
+  Artificial intelligence-Volume 2}, pages 1079--1082. Morgan Kaufmann
+  Publishers Inc., 1985.
+
+\bibitem{burns2010best}
+E.~Burns, S.~Lemons, W.~Ruml, and R.~Zhou.
+\newblock Best-first heuristic search for multicore machines.
+\newblock {\em Journal of Artificial Intelligence Research}, 39:689--743, 2010.
+
+\bibitem{culberson1998pattern}
+J.~C. Culberson and J.~Schaeffer.
+\newblock Pattern databases.
+\newblock {\em Computational Intelligence}, 14(3):318--334, 1998.
+
+\bibitem{dillenburg1994perimeter}
+J.~F. Dillenburg and P.~C. Nelson.
+\newblock Perimeter search.
+\newblock {\em Artificial Intelligence}, 65(1):165--178, 1994.
+
+\bibitem{ertel2018introduction}
+W.~Ertel.
+\newblock {\em Introduction to artificial intelligence}.
+\newblock Springer, 2018.
+
+\bibitem{gendron1994parallel}
+B.~Gendron and T.~G. Crainic.
+\newblock Parallel branch-and-branch algorithms: Survey and synthesis.
+\newblock {\em Operations research}, 42(6):1042--1066, 1994.
+
+\bibitem{goldberg1989}
+D.~E. Goldberg et~al.
+\newblock {\em Genetic algorithms in search, optimization, and machine
+  learning}, volume 412.
+\newblock Addison-wesley Reading Menlo Park, 1989.
+\newblock Cubre el tema de algoritmos genéticos.
+
+\bibitem{harikumar1996iterative}
+S.~Harikumar and S.~Kumar.
+\newblock Iterative deepening multiobjective.
+\newblock {\em Information Processing Letters}, 58:11--15, 1996.
+
+\bibitem{heineman2016algorithms}
+G.~T. Heineman, G.~Pollice, and S.~Selkow.
+\newblock {\em Algorithms in a nutshell: a practical guide}.
+\newblock " O'Reilly Media, Inc.", 2016.
+
+\bibitem{holte2010common}
+R.~C. Holte.
+\newblock Common misconceptions concerning heuristic search.
+\newblock In {\em Third Annual Symposium on Combinatorial Search}, 2010.
+
+\bibitem{holte2006maximizing}
+R.~C. Holte, A.~Felner, J.~Newton, R.~Meshulam, and D.~Furcy.
+\newblock Maximizing over multiple pattern databases speeds up heuristic
+  search.
+\newblock {\em Artificial Intelligence}, 170(16-17):1123--1136, 2006.
+
+\bibitem{kaindl1995use}
+H.~Kaindl, G.~Kainz, A.~Leeb, and H.~Smetana.
+\newblock How to use limited memory in heuristic search.
+\newblock In {\em IJCAI}, pages 236--242, 1995.
+
+\bibitem{kaindl1994memory}
+H.~Kaindl and A.~Khorsand.
+\newblock Memory-bounded bidirectional search.
+\newblock In {\em AAAI}, pages 1359--1364, 1994.
+
+\bibitem{kirkpatrick1983optimization}
+S.~Kirkpatrick, C.~D. Gelatt, and M.~P. Vecchi.
+\newblock Optimization by simulated annealing.
+\newblock {\em science}, 220(4598):671--680, 1983.
+
+\bibitem{korf1985depth}
+R.~E. Korf.
+\newblock Depth-first iterative-deepening: An optimal admissible tree search.
+\newblock {\em Artificial intelligence}, 27(1):97--109, 1985.
+
+\bibitem{korf1990depth}
+R.~E. Korf.
+\newblock Depth-limited search for real-time problem solving.
+\newblock {\em Real-Time Systems}, 2(1-2):7--24, 1990.
+
+\bibitem{korf1993linear}
+R.~E. Korf.
+\newblock Linear-space best-first search.
+\newblock {\em Artificial Intelligence}, 62(1):41--78, 1993.
+
+\bibitem{korf1996improved}
+R.~E. Korf.
+\newblock Improved limited discrepancy search.
+\newblock In {\em AAAI/IAAI, Vol. 1}, pages 286--291, 1996.
+
+\bibitem{korf1997finding}
+R.~E. Korf.
+\newblock Finding optimal solutions to rubik's cube using pattern databases.
+\newblock In {\em AAAI/IAAI}, pages 700--705, 1997.
+
+\bibitem{korf2001time}
+R.~E. Korf, M.~Reid, and S.~Edelkamp.
+\newblock Time complexity of iterative-deepening-a*.
+\newblock {\em Artificial Intelligence}, 129(1-2):199--218, 2001.
+
+\bibitem{korf1996finding}
+R.~E. Korf and L.~A. Taylor.
+\newblock Finding optimal solutions to the twenty-four puzzle.
+\newblock In {\em Proceedings of the national conference on artificial
+  intelligence}, pages 1202--1207, 1996.
+
+\bibitem{korf2000divide}
+R.~E. Korf and W.~Zhang.
+\newblock Divide-and-conquer frontier search applied to optimal sequence
+  alignment.
+\newblock In {\em AAAI/IAAI}, pages 910--916, 2000.
+
+\bibitem{korf2005frontier}
+R.~E. Korf, W.~Zhang, I.~Thayer, and H.~Hohwald.
+\newblock Frontier search.
+\newblock {\em Journal of the ACM (JACM)}, 52(5):715--748, 2005.
+
+\bibitem{mcaleer2018solving}
+S.~McAleer, F.~Agostinelli, A.~Shmakov, and P.~Baldi.
+\newblock Solving the rubik's cube without human knowledge.
+\newblock {\em arXiv preprint arXiv:1805.07470}, 2018.
+
+\bibitem{michalewicz2013solve}
+Z.~Michalewicz and D.~B. Fogel.
+\newblock {\em How to solve it: modern heuristics}.
+\newblock Springer Science \& Business Media, 2013.
+
+\bibitem{nilsson2010}
+N.~J. Nilsson.
+\newblock {\em The quest for artificial intelligence}.
+\newblock Cambridge University Press, 2010.
+\newblock Discute extensivamente el área de Inteligencia Artificial mostrando
+  su evolución histórica y aplicaciones.
+  \url{http://ai.stanford.edu/~nilsson/QAI/qai.pdf}.
+
+\bibitem{ochoa2012hyflex}
+G.~Ochoa, M.~Hyde, T.~Curtois, J.~A. Vazquez-Rodriguez, J.~Walker, M.~Gendreau,
+  G.~Kendall, B.~McCollum, A.~J. Parkes, S.~Petrovic, et~al.
+\newblock Hyflex: A benchmark framework for cross-domain heuristic search.
+\newblock In {\em European Conference on Evolutionary Computation in
+  Combinatorial Optimization}, pages 136--147. Springer, 2012.
+
+\bibitem{pearl1984}
+J.~Pearl.
+\newblock {\em Heuristics: intelligent search strategies for computer problem
+  solving}.
+\newblock Addison-Wesley Pub. Co., Inc., Reading, MA, 1984.
+\newblock Cubre el tema de resolución de problemas. Búsquedas informadas.
+
+\bibitem{prieditis1993machine}
+A.~E. Prieditis.
+\newblock Machine discovery of effective admissible heuristics.
+\newblock {\em Machine learning}, 12(1-3):117--141, 1993.
+
+\bibitem{reinefeld1994enhanced}
+A.~Reinefeld and T.~A. Marsland.
+\newblock Enhanced iterative-deepening search.
+\newblock {\em IEEE Transactions on Pattern Analysis and Machine Intelligence},
+  16(7):701--710, 1994.
+
+\bibitem{rubik1987rubik}
+E.~Rubik.
+\newblock {\em Rubik's cubic compendium}, volume~3.
+\newblock Oxford University Press, USA, 1987.
+
+\bibitem{russell2009}
+S.~Russell and P.~Norvig.
+\newblock {\em Artificial intelligence: A modern approach (3rd or 2nd
+  Edition)}.
+\newblock Prentice Hall, 2009.
+\newblock El libro de referencia del curso. Cubre prácticamente todos los
+  temas a tratar.
+
+\bibitem{zhang2000depth}
+W.~Zhang.
+\newblock Depth-first branch-and-bound versus local search: A case study.
+\newblock In {\em AAAI/IAAI}, pages 930--935, 2000.
+
+\bibitem{zhang1993depth}
+W.~Zhang and R.~E. Korf.
+\newblock Depth-first vs. best-first search: New results.
+\newblock In {\em AAAI}, pages 769--775, 1993.
+
+\bibitem{zhou2002memory}
+R.~Zhou and E.~A. Hansen.
+\newblock Memory-bounded a* graph search.
+\newblock In {\em FLAIRS conference}, pages 203--209, 2002.
+
+\bibitem{zhou2006breadth}
+R.~Zhou and E.~A. Hansen.
+\newblock Breadth-first heuristic search.
+\newblock {\em Artificial Intelligence}, 170(4):385--408, 2006.
+
+\end{thebibliography}

curso-search/referencias/refs.blg

+This is BibTeX, Version 0.99d (TeX Live 2015/Debian)
+Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
+The top-level auxiliary file: refs.aux
+The style file: abbrv.bst
+Database file #1: referencias.bib
+You've used 37 entries,
+            2118 wiz_defined-function locations,
+            719 strings with 9200 characters,
+and the built_in function-call counts, 13313 in all, are:
+= -- 1344
+> -- 529
+< -- 13
++ -- 211
+- -- 172
+* -- 865
+:= -- 2099
+add.period$ -- 117
+call.type$ -- 37
+change.case$ -- 187
+chr.to.int$ -- 0
+cite$ -- 37
+duplicate$ -- 555
+empty$ -- 1110
+format.name$ -- 172
+if$ -- 2868
+int.to.chr$ -- 0
+int.to.str$ -- 37
+missing$ -- 45
+newline$ -- 192
+num.names$ -- 74
+pop$ -- 226
+preamble$ -- 1
+purify$ -- 158
+quote$ -- 0
+skip$ -- 417
+stack$ -- 0
+substring$ -- 957
+swap$ -- 156
+text.length$ -- 13
+text.prefix$ -- 0
+top$ -- 0
+type$ -- 132
+warning$ -- 0
+while$ -- 139
+width$ -- 39
+write$ -- 411