package worksheet;

import becker.robots.City;
import becker.robots.Direction;
import becker.robots.Robot;

public class Sweeper {

    public static void main(String[] args) {

        /*
         * Your robot is a street cleaner! It needs to sweep up all the
         * Things from the street. Write the most efficient code to make
         * the robot sweep the streets within the city walls.
         * Note that some intersections are clean with no Things, but
         * some intersection have many Things. Your robot must pick
         * up all the Things in the city.
         * Tip:
         * - start with sweeping just the first row so the robot picks up
         * all the things and doesn't crash when it hits the wall
         * - at the end of a row, the robot needs to go south one intersection
         * then turn either east or west - how do you know which way
         * to turn? hint: look at the street number the robot is on
         * - get this working so that it goes down one intersection and
         * turns in the proper direction
         * - then add the code to repeat the above 2 steps until the robot
         * is in the last row (how do you know where the last row is?)
         */
        City city = new City("cityfiles/sweeper/Sweeper02.cty");
        Robot bot = new Robot(city, 1, 1, Direction.EAST);

       
    }
}