Author: Robert Hyatt
Date: 18:31:59 06/26/00
Go up one level in this thread
On June 26, 2000 at 12:31:22, ujecrh wrote: >I wonder if it has already been tried or if it is not useful/feasible at all. > >The idea is that, excepting special moves like castle or en-passant we could >easilly generate all possible moves for all possible piece/square at the very >start of the engine. It would fill some arrays (like >rook_moves[square][directions][moves/or destination square])with a total of >about 4000 entries. Actually it is about 7,000 entries when you consider all the odd cases. You need to look up "All the right moves" A PhD dissertation by Carl Ebeling at Carnegie-Melon University. Carl did the hitech single-chip move generator which was based on just this observation. > >Having not to generate moves during the search itself might save some time and >even a slow move generator wold not be a problem as it would be called only at >initialization of the engine. > >Is that completely wrong ? > >Ujecrh There are non-obvious issues about blocked squares for sliding pieces that makes this problematic...
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.