Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: bitboards and incrementally updated attack tables.

Author: Eric Oldre

Date: 18:01:42 06/30/04

Go up one level in this thread


On June 30, 2004 at 18:29:11, Russell Reagan wrote:

>
>My gut feeling is that you shouldn't mess with this now. Write clear, flexible
>code that allows you to make this change later without too much difficulty.
>
>I would recommend sticking to computing things on the fly and only detect
>attacks (or whatever else) when you need to. Avoid computing things that you
>might not need. After you spend a while working on your engine (6 months to a
>year maybe), and you have a better idea of what your engine will be doing, then
>you can reasses things.
>
>Christophe Theron (author of Chess Tiger) is a proponent of doing everything on
>the fly and using testing to be sure that you are actually making progress.
>"Don't mistake activity for progress", as the saying goes.


Russell,
Thanks for the well thought out advise (again). You are probably right, I'll
just need to make sure to make my code flexible enough to handle a change like
that later if required.

My reasoning for wanting the attacks_from computed is it would make it possible
to quickly determine mobility scores for pieces, which is something I hope to do
later, and attacks_to would make computing king safety faster, when i need to
determine which peices are attacking the area around a king.

but for now i will concentrate on making code with as few bugs as possible,
slowly adding features.

Eric.



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.