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

Uniform-cost-search(problem)

  OPEN ( make-node(problem[init-state], NIL, 0) )
  CLOSE NIL
  while open ( ) do
    next pop(OPEN)
    CLOSE CLOSE {next}
    if problem[goal-test](next) then
      return(path(new))
    loop for s in expand(next[state])
      if not(find-state(s, CLOSE) then
        new-cost next[g]+cost(next[state], s)
        old-node find-state(s, OPEN)
        if old-node then
          if old-node[g] > new-cost then
            old-node[g] new-cost
            old-node[parent] next
            ; Insert an item into a sorted list according to field g
            insert(old - node, OPEN - {old-node}, g)

        else ; no node with same state in open
          new make-node(s, next, new-cost)
          insert(new, OPEN, g)
    return(FAIL) ; OPEN is empty - no solution