Computer Chess Club Archives

Search

Messages

Subject: Incremental movegenerator?

Author: Andreas Rueckert

Date: 01:47:44 04/14/03

Hi!

I'm thinking about a incremental movegenerator for our little project. The idea
is to store the moves for the pieces in a array and then check the last moved
pieces, if they intersect with the potential moves of the piece on the square.
If not, the moves that were computed before the piece was moved, could be
reused. Has this been done before? (I guess so, since almost everything has been
tried in this field, as it seems to me). Are there any numbers, how much
performance gain is too expect from such a solution?


TIA,
Andreas

• Re: Incremental movegenerator? Vincent Diepeveen 07:13:07 04/15/03
  • Re: Incremental movegenerator? Andreas Rueckert 23:40:46 04/15/03
  • Re: Incremental movegenerator? Uri Blass 09:48:06 04/15/03
    • Re: Incremental movegenerator? Vincent Diepeveen 10:43:50 04/15/03
      • Re: Incremental movegenerator? Uri Blass 11:41:41 04/15/03
        • Re: Incremental movegenerator? Vincent Diepeveen 13:46:11 04/15/03
• Re: Incremental movegenerator? Tony Werten 01:42:45 04/15/03
• Re: Incremental movegenerator? Reinhard Scharnagl 08:36:49 04/14/03

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.