Author: Andrew Williams
Date: 02:48:43 12/24/02
Go up one level in this thread
On December 23, 2002 at 19:13:41, Bas Hamstra wrote:
>>Other ideas would be: create the move list sorted. To add a new generated move,
>>a binary search for the position in the list would be enough. I doubt, that one
>>can save significant time.
>
>I doubt it too. A couple of days I did an 0x88 experiment to see if I could use
>a C++ STL container ("map") to keep a sorted piecelist. I theory it should be
>efficient, but the result was dramatical. Make/Unmake became a factor 8 slower
>or so. Not a good idea apparently.
>
>Best regards,
>Bas.
I'm not sure that the STL should be used where great speed is required. In the
video games industry it has a reputation for being slow. I've no experience of
my own to contribute, however.
Andrew
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.