Author: Robert Hyatt
Date: 08:56:00 10/21/02
Go up one level in this thread
On October 21, 2002 at 01:01:44, Nagendra Singh Tomar wrote: >Hi All, > I would like to know whether updating attacks_from/attacks_to arrays in >make/unmake move is efficient or calculating this info whenver needed is >efficient. In my last chess program I found out that over a longer program run >both turn out to be equally efficient. I mean the fact that updating >attacks_from/attacks_to for all squares (some of which might not be used at all) >turns out to be equally bad/good as compared to calculating it from scratch >every time I need it (mostly in eval or check detection); >What is your opinion ? > >regards >tomar You have to test this for yourself as there are too many variables involved. I used to do this, but after I came up with the idea of rotated bitboards, I quit and started doing the calculations as needed, and that was faster for me. But you have to test to see if it is faster for you...
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.