School of Engineering and Applied Science Department of Computer Science CSci 133 -- Algorithms and Data Structures I http://www.seas.gwu.edu/~csci133/spring06 Prof. Michael B. Feldman mfeldman@gwu.edu

Part 1: Develop a new version of the KnightSequence class that uses a linked list instead of an array to implement the sequence, and run the KnightTour you developed for Project 2, with the new class instead of the old one. 

• The new class must present exactly the same interface to the client program: exactly the same methods, same parameters, etc. You must be able to run the Project 2 KnightTour without changing it at all.
• The class is reimplemented by defining new data structures and reimplementing all of the methods to work with them. 
• Start by saving a copy of your existing KnightSequence class. (For example, just type cp KnightSequence.java KnightSequence-save.java.) Then modify the original class file by deleting the data structures, and the bodies of all the methods, and filling in new data structures and bodies.
• The new implementation must use a linked list with front and rear references.