The knights tour. Chosing a container
<p>I have been reading up on C++ lately, especially STL, and I decided to do the Knights Tour problem again. I'm thinking about the best way to implement this, and I'm looking for some help. </p>

<p>Just for fun and practice, I thought I'd start with a "Piece" base class, which a "Knight" class can inherit from. I want to do this so I later can try adding other pieces(even though most of the pieces can't walk over the whole board and complete the problem).</p>

<p>So the "piece class" will need some sort of container to store the coordinates of the piece on the board and the number of moves it has made in that specific step.</p>

<p>I'm thinking I need a linked list with 64 (8 * 8) places to do this most efficiently, containing x,y and moves.</p>

<p>Looking at the STL containers, I can't find anything except map that will hold more than one type. </p>

<p>What can I do to store the coordinate pair and an int for the number of moves in one container? Are there more efficient ways of doing this than using vector, list or map? Do I need a custom container?</p>

<p>Thanks!</p>
