Piece-list representation

[Sune Fischer]

So if I get that right, to insert a queen you move the first rook to the back of rooks, the first bishop to the back of bishops and so on, to make room for new queen and when deleting you do the opposite?

Is this faster than shifting the whole array?

-S

[Reinhard Scharnagl]

When promoting I detach the pawn from the list and insert a queen or rook etc. at a matching place I search from king, which is always the first piece in each list.

Reinhard.

[Dann Corbit]

I'm now considering using a double linked list where each piece belongs to two lists: a list of pieces of same color, and a list of pieces of same color and type.
{snip}

Consider a skiplist, which gives random access and automatically sorts the entries.

[Dan Andersson]

Different ADTs have different strengths. Doubly linked lists have nice effective properties when it comes to making and unmaking changes in backtracking searches like depth-first search. See for example the efficient use in Knuth's 'Dancing Links' paper:
http://www-cs-faculty.stanford.edu/~knu ... olor.ps.gz