Computer Programs 2 questions ?

Can anyone explain to me how a chess program calculates what is a
good move/good position?
Also what is the best strategy for beating computers ?
cheers
Jay

Most programs have databases ranging from 100,000 to 500,000
games and certain positions...it crunches through those looking for
the best possible set up.

With a hammer.

Dave

I was more thinking of those older programs that don't rely on having
many games stored away in their memory.

Old programs are pretty easy...first off they will not trade dwon
material..i.e a rook for a knight.

Look into setting up classic sacs...like the Bxh7 sac...most always fall
for that one.

Dave

They use what they call hash tables.Basically,it is horsepower comparing
positions and potential positions.Exactly what move is chosen depends on what
the programmers put in as good or bad.Garbage in-garbage out,
These hash tables create move horizons beyond which the machine will not
consider.This is why they are iffy with long term plans.

How to beat them?..well don't play tactics with ironthing.You cannot see
millions of positions per second so you can't outcalculate ironthing
tactically.Kaparov tryed this against Deep Blue and predictably failed.An early
chop of the queens is a good idea since the queen is often involved in wild and
wooly tactics.Weaken it's pawn structure.Ironthing does not always understand
the importance of pawn structure.

Check out the Brains in Bahrain site to see how Kramnik is dissecting "Super"
Fritz.Next game on Sunday the 13th 8am Eastern Standard Time.You can watch it
live and get in on the kibitzing.

I wanted to copy an article but it doesn't work. too long probably.

check it out here:

http://www.cs.ualberta.ca/~tony/ICCA/anatomy.html

Gil.