Page 11 - E-Book Kecerdasan Buatan Dandung PTI 1A
P. 11
Gambar 2.4 Proses Kerja DFS
Adapun algoritma metode DFS ditunjukkan dibawah ini.
The algorithm :
open : = [ start ];
closed : = [ ];
while open != [ ] do
remove leftmost state from open, call it X;
if X is a goal then
return success;
else
begin
generate children of X ;
put X on closed;
eliminate children of X if already in open or
closed;
put other children in order on left end of open;
end
end while
return failure;
8
