import java.util.*;

/**
 * A map of the tunnel system. Assume the data
 * has already had the single entrance converted
 * to 4 in this part. If not we'll need to do that
 * convrsion on the fly (TO DO).
 */

public class Map
{
    public Map (Vector<String> input, boolean debug)
    {
        _theMap = new Vector<Cell>();
        _entrances = new Vector<Coordinate>();
        _keys = new Vector<Character>();
        _doors = new Vector<Character>();
        _debug = debug;

        createMap(input);
    }

    public Vector<Coordinate> getEntrances ()
    {
        return _entrances;
    }

    /**
     * Return the content of the Cell represented by the Coordinate.
     */

    public char getContent (Coordinate coord)
    {
        int index = _theMap.indexOf(new Cell(coord));
        Cell theCell = _theMap.get(index);

        return theCell.getContents(); // assume no error
    }

    /*
     * Is this Coordinate in range and can be moved into?
     */

    public boolean validPosition (Coordinate coord)
    {
        if ((coord.getX() >= 0) && (coord.getY() >= 0))
        {
            if ((coord.getX() < _maxX) && (coord.getY() < _maxY))
            {
                int index = _theMap.indexOf(new Cell(coord));

                if (index != -1) {
                    Cell theCell = _theMap.get(index);

                    if (theCell != null)
                        return !theCell.isWall();
                }
            }
        }

        return false;
    }

    public int numberOfKeys ()
    {
        return _keys.size();
    }

    public int numberOfDoors ()
    {
        return _doors.size();
    }

    @Override
    public String toString ()
    {
        Enumeration<Cell> iter = _theMap.elements();
        int index = 1;
        String str = "Map <" + _maxX + ", " + _maxY + ">:\n\n";

        while (iter.hasMoreElements())
        {
            str += iter.nextElement().getContents();

            if (index++ == _maxX)
            {
                str += "\n";

                index = 1;
            }
        }

        return str;
    }

    // create the map from input

    private void createMap (Vector<String> input)
    {
        Enumeration<String> iter = input.elements();
        int y = -1;

        _maxX = input.get(0).length(); // all lines are the same length (check?)

        while (iter.hasMoreElements())
        {
            y++;

            String line = iter.nextElement();

            for (int x = 0; x < _maxX; x++)
            {
                Cell theCell = new Cell(new Coordinate(x, y), line.charAt(x));

                if (theCell.isEntrance())
                    _entrances.add(theCell.position());
                else
                {
                    if (theCell.isKey())
                        _keys.add(theCell.getContents());
                    else
                    {
                        if (theCell.isDoor())
                            _doors.add(theCell.getContents());
                    }
                }

                if (_debug)
                    System.out.println(theCell);

                _theMap.add(theCell);
            }
        }

        _maxY = y + 1;
    }

    private Vector<Cell> _theMap;
    private int _maxX;
    private int _maxY;
    private Vector<Coordinate> _entrances;
    private Vector<Character> _keys;
    private Vector<Character> _doors;
    private boolean _debug;
}
@@ -198,16 +198,122 @@
 TO DO).%0A
+ * %0A * Split into 4 Maps and work each robot until it%0A * has to wait for another, then swap between them?%0A
  */%0A%0Apub
@@ -468,24 +468,77 @@
 rdinate%3E();%0A
+        _locationsOfKeys = new Vector%3CCoordinate%3E();%0A
         _key
@@ -2918,24 +2918,112 @@
 ll.isKey())%0A
+                    %7B%0A                        _locationsOfKeys.add(theCell.position());%0A
             
@@ -3060,32 +3060,54 @@
 getContents());%0A
+                    %7D%0A
                 
@@ -3577,24 +3577,73 @@
 _entrances;%0A
+    private Vector%3CCoordinate%3E _locationsOfKeys;%0A
     private 

Update Map.java