Author: Tony Werten
Date: 01:42:45 04/15/03
Go up one level in this thread
On April 14, 2003 at 04:47:44, Andreas Rueckert wrote: >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? For my program, generating moves in 0 seconds would give a speedup <3% You can test some programs. Run them trough a profiler and see the time spent. Generating moves doesn't cost time ( relatively ) It's the searching and evaluating that's expensive. Tony > > >TIA, >Andreas
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.