Problem : Move the chess piece "KNIGHT" from any location on a
"3 x 3" Chess Board and make it go to the far right
hand bottom corner^. Chess Board in the problem is
not the usual Chess Board of 8 x 8.
KNIGHT starting position may be any position on board
Program should exit when knight moves to 3 x 3 corner.
Here is how my Chess board looks.
1 2 3
-------------------------
| | | |
1 | | | |
| | | |
-------------------------
| | | |
2 | | | |
| | | |
-------------------------
| | | |
3 | | | X | <<<<------- KNIGHT should reach
| | | | this square.
-------------------------
Remember: KNIGHT moves in specific way such as 2 steps in
one direction and 1 step left/right.
If the KNIGHT starts are position (2,2) then it cannot move further and
you have to throw exception with some error message.
We are not interested in any UI programming.
Run command: "java <some class> x y", where x is x-coordinate
and y is y-coordinate(starting position of Knight)
on the chess board. For this problem x & y could be
1(min) and 3(max) values and any value(2) in between.
Deliver : 1) Send me the java code for above problem.
2) Java code should compile and run.
3) I will be interested in "Object Oriented Design"
thought process.
4) Your coding style
5) Javadoc
6) Makefile
7) Your test results
I would be more interested in your class design, interface design and error handling, how it will work for a 8 X 8 board, whether the knight picks the shortest path to reach and how you tested this.
Optimism is an occupational hazard of programming: testing is the treatment...
K. Beck
Please use [CODE]...your code here...[/CODE] tags when posting code. If you get an error, please post the full error message and stack trace, if present.
I just so happen to have this problem already worked out. I am willing to part with it for 8 goats, 5 chickens and 1 elephant. Please let me know if we can work something out (I would be willing to substitute the elephant for a unicorn).
I tried and tried and tried but no luck. Can you share the link you know....
I don't know of any specific link, I just did a search and read a couple of the articles and they talked of using Dijkstra's algorithm and the A* algorithm. I'm sure with a little more reading/searching I could have found some code or at the every least some pseudo code to implement the algorithms.
OK, let me take time out from my 40+ hours a week working and my (sometimes non-existent) life to write your homework for you so you don't have to put any effort at all into your final course grade.
Sorry, just my turn to let off some steam, I guess. Thanks to dlorde, keang and programthis for being more diplomatic.
Reply With Quote
Where did I say I had code?
Bookmarks