Author: Will Singleton
Date: 18:54:16 12/22/99
Go up one level in this thread
On December 22, 1999 at 21:35:45, Andrew Dados wrote: >On December 22, 1999 at 21:22:52, Will Singleton wrote: > >>On December 22, 1999 at 21:11:12, Tom Kerrigan wrote: >> >>>Personally, I like linked lists, but I think most people just have arrays of >>>integers that hold the squares of pieces. >>>-Tom >>> >>>On December 22, 1999 at 20:20:00, Will Singleton wrote: >>> >>>>On December 22, 1999 at 19:26:40, Tom Kerrigan wrote: >>>> >>>>>The program will be 300% faster if you use piece lists of some sort. ;) >>>>>-Tom >>>>> >>>>> >>>> >>>>What kind of piece-lists? >>>> >>>>Will >> >>I'm not the most observant guy, I guess, so I don't use any piece lists. In >>what way can they help? (btw, posting at the top of msgs makes it tough for >>others to follow) >> >>Will > >It speeds up move generation/capture generation because instead of scanning >whole board for your pieces (or opponents pieces to capture), you have them in >the list already (sorted in MV-first order usually). No idea how it speeds up >bitboard-based generators, but for my 0x88 representation speedup is probably >around 200% (I generate _captures only_ first). Oh.. and finding king square is >a snap: ksq=pieces[player][0]->square; :) > >Merry Christmass- >-Andrew- And a Merry Christmas to you, bud. I, however, don't think movegen is much of a factor in overall speed (200% really? Am I wrong?) I scan the board. And, I carry the king squares around in vars. Will
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.