Author: Russell Reagan
Date: 13:12:22 05/29/04
Go up one level in this thread
On May 29, 2004 at 14:41:28, Anthony Cozzie wrote: >The magic of Vincent's generator is that there are almost no branches and >relatively little memory. The two biggest wastes of time in a modern deeply >pipelined superscalar processor are branch mispredictions and cache misses. Okay, but how is that different from an efficiently implemented classical array based move generator? Is the basic idea the same as the code snippet on Bruce's website(http://www.brucemo.com/compchess/programming/movetable.htm)?
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.