Article on proposed heuristic for computer chess program

[Gerd Isenberg]

The following link
http://mysite.verizon.net/vzesz4a6/current/id80.html

takes you to an article I wrote on a new idea for doing the evaluation function for a chess program.

Some of you have seen this before. Any comments, good or bad, are welcome.

Interesting paper - thanks.

One idea is to use fill-algorithms to implement progressive mobility and/or to look for defending or attacking trajectories. Some more or less related topics from the CCC-archives...

http://www.stmintz.com/ccc/index.php?id=12468
http://www.stmintz.com/ccc/index.php?id=253182
http://www.stmintz.com/ccc/index.php?id=389955
http://www.stmintz.com/ccc/index.php?id=404510

Cheers,
Gerd

[YL84]

Hi, thanks for the article! Interesting ideas, though nothing really new. Mobility, pressure on the opponent are not sufficiant to build a good evaluation. I guess the real Rybka secret is the very good evaluation of the pawn structure, especially in endings. Candidate pawns should have no secret for this engine.
my 2 cents,
yves