Instructions regarding Assignment 1:

1. The 1st assignment is due on the 4th of October 2012.
2. You are supposed to code ALL assignments using Java unless specified otherwise.
3. Please read ALL the instructions posted in the Problem Statements carefully.
4. DETAILS FOR THE SUBMISSION OF THE ZIP FILE ARE GIVEN BELOW.

Grading Scheme for Assignment 1:

The 1st assignment will be graded on 100 points. Following is the split-up,
1. Efficient code along with good documentation: 25 points
2. Correctness of results/conclusions drawn: 25 points
3. A detailed report outlining your approach, results obtained & analysis performed: 50 points

***SUBMISSION DETAILS***:

a. Please name your zip file as follows "FirstName_LastName_A1.zip". For example: Saad_Nadeem_A1.zip
b. There should only be ONE zip file emailed per student, so please zip all the contents in to a SINGLE zip file.
c. As mentioned, the zip file should contain 4 items, source code, trace, test set (if applicable) & report.
d. Please email the zip file to sanadeem [at] cs [dot] stonybrook [dot] edu on or before 11:59 pm on Thursday (10/04/2012).

DOUBTS/ELABORATION ON THE ASSIGNMENT:

1) Assume an input file where the board comes in 7 lines and each line corresponds to data in one row as described in the writeup and should be in a "comma-separated" format.
2) We define a move as a sequence of steps where in each step one peg is removed. The move terminates when a configuration is reached, as a result of which no more pegs can be removed.
3) IMPORTANT Clarification for the definition of "move":
	To make the problem interesting, we are redefining the move. We are adding the notion of mulitple consecutive jumps/steps in one move.
		For example, you have the configuration [o o x o x], where 'o' defines a peg and 'x' defines an empty space. In one move, here, you can remove two pegs, by jumping over the empty spaces twice with the first peg like [x x o o x] by removing the second peg and then [x x x x o] by removing the peg on the 4th position.
4) The moves can be partial and you don't necessarily have to stop in multiple jumps, until no more pegs can be removed.