Question about bitbases
Posted: Sat Feb 02, 2008 9:08 am
Hi,
first of all i have to say that i have no idea how bitbases internally work. So sorry for my "silly" question.
I have noticed in engine games that the most valuable information you need from bitbases is the draw score. If an engine knows which positions are draws the engine is always/mostly able to win (if it is an winning position) or draw (if you only can draw). so i only would need the positions in the bitbases which are draws. all winning/loosing positions are worthless. if you only store draw positions in bitbases could it be that they are much less in size and that it would be faster to probe them?
Thomas
first of all i have to say that i have no idea how bitbases internally work. So sorry for my "silly" question.
I have noticed in engine games that the most valuable information you need from bitbases is the draw score. If an engine knows which positions are draws the engine is always/mostly able to win (if it is an winning position) or draw (if you only can draw). so i only would need the positions in the bitbases which are draws. all winning/loosing positions are worthless. if you only store draw positions in bitbases could it be that they are much less in size and that it would be faster to probe them?
Thomas