בינה מלאכותית

Breadth-first-search-G(problem)
  OPEN ( make-node(problem[init-state], NIL) )
  CLOSE NIL
  while open ( ) do
    next-node pop(OPEN)
    CLOSE CLOSE {next-node}
    loop for s in expand(next-node[state])
      if not(find-state(s, OPEN) or find-state(s, CLOSE)) then
        new make-node(s, next-node)
        if problem[goal-test](s) then return(path(new))
        OPEN OPEN || (new)


find-state(state, node-list)
  for each node in node-list
    if node[state]=state then return TRUE
  return FALSE