Author: Nagendra Singh Tomar
Date: 03:50:13 10/21/02
Go up one level in this thread
On October 21, 2002 at 04:18:08, Russell Reagan wrote: >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 ? > >What board representation are you using? If it's an offset/array based then >handling attacks will be different than handling attacks using bitboards. I >personally am a big fan of bitboards, and more recently a big fan of non-rotated >bitboards :) > >Russell I am using bitboards. tomar
This page took 0.02 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.