October 2024
Intermediate to advanced
390 pages
10h 52m
Spanish
Content preview from Algoritmos en pocas palabras, 2ª edición
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Capítulo 7. La búsqueda de caminos en la IA
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
Para resolver un problema cuando no hay un cálculo claro de una solución válida, recurrimos a la búsqueda de caminos. Este capítulo abarca dos enfoques relacionados de búsqueda de caminos: uno que utiliza árboles de juego para juegos de dos jugadores y otro que utiliza árboles de búsqueda para juegos de un jugador. Estos enfoques se basan en una estructura común, a saber, un árbol de estados cuyo nodo raíz representa el estado inicial y los perímetros representan movimientos potenciales que transforman el estado en un nuevo estado. Las búsquedas suponen un reto porque la estructura subyacente no se computa en su totalidad debido a la explosión del número de estados. En un juego de damas, por ejemplo, hay aproximadamente 5*1020 configuraciones de tablero diferentes (Schaeffer, 2007). Por tanto, los árboles sobre los que procede la búsqueda se construyen a demanda, según sea necesario. Los dos enfoques de búsqueda de caminos se caracterizan como sigue:
- Árbol del juego
-
Dos jugadores se turnan alternando movimientos que modifican el estado del juego a partir de su estado inicial. Hay muchos estados en los que cualquiera de los dos jugadores puede ganar la partida. También puede haber algunos estados de "empate" en los que nadie gana. Un algoritmo de búsqueda de caminos maximiza la probabilidad de que un jugador gane o fuerce ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.