El algoritmo primero en profundidad funciona de la manera como lo muestra este esquema:

A continuacion, el algoritmo de busqueda Depth First:

Begin
open := [Start];
closed := [ ];
while open ? [ ] do
begin
remove leftmost state from open, call it X;
if X is a goal then returns SUCCESS
else begin
generate children of X;
put X on closed;
discard children of X if already on open or closed;
put remaining children on left end of open
end
end
return FAIL
end

A continuacion se muestra un arbol, el cual va a ser recorrido hasta encontrar el nodo U

La implementacion del algoritmo seria:

open = [A]; closed = [ ]
open = [B,C,D]; closed = [A]
open = [E,F,C,D]; closed = [B,A]
open = [K,L,F,C,D]; closed = [E,B,A]
open = [S,L,F,C,D]; closed = [K,E,B,A]
open = [L,F,C,D]; closed = [S,K,E,B,A]
open = [T,F,C,D]; closed = [L,S,K,E,B,A]
open = [F,C,D]; closed = [T,L,S,K,E,B,A]
Continua hasta encontrar U, o open = [ ].

]]> http://cienciasdelacomputacion.com/algoritmo-primero-en-profundidad/feed/ 0