SEIAP
Practica para Sistemas expertos IA sobre un puzzle.
Algoritmo de ordenacion.
function TreeSeach(initialState,goalState) return SUCCES of FAIL
initialize List frontier with initialState
while nor frontier.isEmpty()
state = frontier.Remove()
if(goalTest(state) = goalState) return SUCCES
foreach child in state.childs
...