anchor.diff:  							(setf new-list (append new-list (list elem lst-elem)))
   							(setf heuristic-value most-positive-fixnum))
   						(setf new-list (append new-list (list lst-elem)))))
  -				(if (= lst-size)
  -					())))
  +				(if (= lst-size (list-length new-list))
  +					(setf new-list (append new-list (list elem))))))
   		new-list))
   
   
  
positive.code: 																				 :jobs-tasks-space novo-estado
  																				 :funcao-heuristica funcao-heuristica-estado))))))))
  	
  	;(dolist (sucessor sucessores)
  	;	(let ((state-value (funcall funcao-heuristica-estado sucessor))
  	;		  (max-sucessor-number (min (max 3 (round (/ (list-length sucessores) 2))) 15)))
  	;		(if (< (list-length sucessor-list) max-sucessor-number)
  	;			(progn
  	;				(setf sucessor-list (append sucessor-list (list sucessor)))
  	;				(if (< state-value min-state-value)
  	;					(setf min-state-value state-value)))
  	;			)))
  
      sucessores))
  
  
negative.code: 		   (heuristic-value (funcall heuristic-function elem))
  		   (lst-size (list-length lst)))
  		(if (null lst)
  			(setf new-list (append new-list (list elem)))
  			(progn
  				(dolist (lst-elem lst)
  					(if (< heuristic-value (funcall heuristic-function lst-elem))
  