Author: Ernst A. Heinz
Date: 15:51:50 10/30/00
Go up one level in this thread
Hi Simon, >been bit twiddling the gnuchess leadz and nbits routines, that find most >significant bit and population count respectively. > >Seems to have had a minor performance benefits (few %) and got rid of the nasty >table lookup's. > >Anyone know of any good reference on these things? You may want to try having a look at my article "How DarkThought Plays Chess" published in the ICCA Journal in 1997. An electronic preprint thereof is available from the WWW pages of "DarkThought" at URL http://supertech.lcs.mit.edu/~heinz/dt/. Moreover, my book on "Scalable Search in Computer Chess" contains an extended version of the article in Appendix A (see the page at http://supertech.lcs.mit.edu/~heinz/node1.html for more information about the book). Please enjoy, =Ernst=
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.