Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Second Q: Am I doing Bitboard this way? And what comes next?

Author: Dann Corbit

Date: 17:51:07 01/24/06

Go up one level in this thread


On January 24, 2006 at 20:22:58, Rolf Tueschen wrote:

>Could you also lead me to the other necessary ingrediants of a chessengine? I
>plan to concentrate myself fully on the chess knowledge I want to implement. But
>this in a later Beta version in Spring 2006. For now I would be satisfied with
>an engine that already plays at 2500 Elo but still without the later fine-tuning
>and ANTI-GM code for all. I know that I wont win Torino 2006 but then I feel
>that Olympic spirit which says Participating is more valuable than Winning. Wont
>you agree with me?
>
>For me this is all also important so that I can speak with all the collegues
>from an equal level if I once have established my new chessengine. I dont want
>to be a newbie anylonger. Sigh.

This thing does not do bitboards at all.
It uses 0x88 board representation.

It does not contain an evaluation function.
It does not contain a search function.
It contains a move generator, and that is all.

For the evaluation function, you can get a working one just by counting the
wood.  Then add stuff to make is smarter as you like.

For the search function, look on Bruce Moreland's page about how to do pvs
searching.  It's not difficult.

The basic idea of pvs searching is that you do a normal alpha-beta search of
your predicted move.  Then, you do a zero window search of all the non-pv nodes.
 That makes the search must faster if you are any good at guessing the right
node to start with.

After you do that, add in IID, which is trivial to implement and will make a
poor searcher search much better and do better move ordering.



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.