Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Minimaliist Move generators

Author: Stan Arts

Date: 10:28:18 01/16/03

Go up one level in this thread


Hi,

Simplest I think would be using arrays as board-representation, and then use a
lot of IF´s (to see what piece is on this square) to generate all possible
moves. Using other IF´s to see what are legal squares, and using for instance
REPEAT or WHILE loops or another type of conditional loop for the sliding
pieces.. I mean this would be very easy to understand, program, and improve.

However it´s not that fast.. But when starting with a chessprogram this is the
way to go I think. Better to focus on other things first, and the speed isn´t
even all that bad. (Maybe you can get to 50% of other techniques such as bit-
boards?)

If you want I can show you the procedures I wrote.. (They simply generate all
legal moves (with a few flags for castling, en-passant etc.) for each side, and
it´s not even that slow. Mine are in Pascal by the way.)

Goodluck!

Stan




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.