Structure of gnuchess

[dragonsoul178 .]

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

[Antonio Ceballos]

Thanks for your interest in GNU Chess. I am afraid that I don't quite 

follow your point. Certainly, GNU Chess 6 is compiled in C++ even

though it mainly uses C constructs rather than (non C) C++ specific

constructs.

If you want to be more specific wrt your purposes with GNU Chess,

I might try to give you a better focused reply.

Regards,

Antonio Ceballos

_______________________________________________
Bug-gnu-chess mailing list
Bug-gn...@gnu.org
https://lists.gnu.org/mailman/listinfo/bug-gnu-chess