computer-go: Deep search = worst play ?

[Joan Pons Semelis <joan@xxxxxxxxxxxxxxxx>]

  With a wide enough search look-ahead usually improves evaluation.
Of course evaluation should be doing what we intended to do: if you
reverse the sign then look-ahead will also improve it ... finding
even worst moves!
  I think that the cases where deepening the search has bring out
consistent worst play (of course sometimes it will change a move
for anoter for bad) are due to a very narrow search, so too many
reasonables moves are left out.
  Of course, the narrower it is, the deeper it can be (time
constraints) but if you left out the good answers no perfect evaluation 
will help. 
  Can the ones that have found that confirm/refute my assumption ?

  Joan