Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Is this solvable by brute force?

Author: Joel

Date: 19:59:11 09/18/03

Go up one level in this thread


Hey Uri,

Don't be too hard on yourself, my program is much, much simpler than yours.

The reason why my pawn hash code took so much less time than yours is clearly
due to the simplicity of my chess engine, not to my programming skill.

Working out the pawn hash key was trivial for my program. Update my makemove
function.

Make a new pawn hash table, most of that a cut and paste job from my normal
transposition table, with a bit of modification.

Modify my evalpawns function (applied at the leaves) to hit my new pawn hash
table initially, and if an entry exists, skip certain evaluation steps.

And regarding the speedup, of course I should easily get 10% due to the fact
that all my evaluation was done at the leaves.

Remember that my engine is nothing fantastic as of yet.

Regards,
Joel





This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.