From: SChazworth <at> AOL <dot> COM
Date: 18 may 1997
Subject: Re: Chess Computers

In a message dated 97-05-17 09:27:52 EDT, you write:

<< They (chess computers) can also tell if a certain move
 will immediately turn into a bad position, and so will skip that move
 when processing the 10 or whatever ply searches.
  >>

The classic difficulty in all games is evaluating all types of 'good
position'.
Some 'bad' exchanges lead to enough time, manuevering space, or position to
force a win.  Kasparov is famous for 'home discovered' sacrifices for these
intangibles.  If a computer skips these, they will skip over many possibly
good positions.