Hello, I assume gnuchess developers here?
My question concerns the version 6 of Gnuchess, and it´s structure. I see that it uses array-based lists, rather than than linked lists in move generation!? Dave suggests that I should study C++ algorithms to understand such code, while I´m not sure. Probably list classes as such can be implemented without using any STL operations found in <algorithm>. So, my question is that is there any textbook out there to teach how to use array-based lists? I hope I was clear enough and my question can be answered reasonably, Regards
_______________________________________________ Bug-gnu-chess mailing list [email protected] https://lists.gnu.org/mailman/listinfo/bug-gnu-chess
