Author: Gerd Isenberg
Date: 23:46:22 03/03/06
Go up one level in this thread
>OK. So you make an array of 128 function pointers then, and do this: > >status = method[hashval(BB)](); Yes, if you like, you can do either switch with a contiguous range as well. But to get pure attacksets, there are no function pointers at all, but pointers to bitboards. > >PGO seems to take a lot of the sting out of missed branch predictions, but of >course there will always be some. It would be interesting to see some pseudocode what your /* Do Stuff */ in the cases does, to implement a kind of "ray-base" e.g. with the position you mentioned recently. If you are interested in a1-h8 related properties of let say square g7. [D]7k/3n2q1/5p2/8/6N1/2Q5/1B6/Q1K5 w - -
This page took 0.01 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.