Author: Severi Salminen
Date: 10:41:43 01/08/01
Go up one level in this thread
>> >>Well, generating moves is slow > >I guess that it is your mistake. > >I do not think that generating moves is slow. > >I think that generating moves if you are interested in pseudo legal moves and >not in legal moves is very fast relative to other things that you want to do in >your chess program. I must disagree on this one. Yes, I am interested in pseudolegal moves and my engine also generates only them. But it is not _that_ fast. I have reprogrammed many move generation routines in assembler and they still take their time. I'm using bitboards not rotated, though. But using pipelining facilities of modern processors one can generate file moves very fast with only a couple of assembly instructions or clock cycles. Changing to rotated would make bishop, rook (and queen) move generation maybe a little faster, but other procedures would slow down at the same time (makeing moves, undoing them, move ordering...). But as I said I don't have enough facts and that's why it would be interesting to test this. I try to add mobility into my evaluation and I'll post some results to here. Probably tomorrow if I have time. And later I try to program rotated bitboards to see how much there _really_ is difference - maybe a lot. Severi
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.